Xiao-Dong Zhang - Citegraph

Author Info

Name	Affiliation	Papers
XIAO-DONG ZHANG	Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200030, People's Republic of China	31
Collaborators	Citations	PageRank
42	97	19.87
Referers	Referees	References
153	218	122

Search Limit

100218

Publications (31 rows)

Collaborators (42 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Turan Numbers For Disjoint Paths	2	0.44	2021
Variations Of The Eccentricity And Their Properties In Trees *	0	0.34	2021
The normality and sum of normalities of trees	0	0.34	2020
The Maximum Spectral Radius of Graphs Without Friendship Subgraphs.	1	0.37	2020
Extremal graphs for vertex-degree-based invariants with given degree sequences	0	0.34	2019
Extremal Trees With Respect To The Steiner Wiener Index	0	0.34	2019
Spectral Extremal Results with Forbidding Linear Forests.	1	0.37	2019
Multi-distance granularity structural -subtree index of generalized Bethe trees.	1	0.35	2019
Erdős-Gallai stability theorem for linear forests.	0	0.34	2019
Block-Circulant Inverse Orthogonal Jacket Matrices and Its Applications to the Kronecker MIMO Channel	0	0.34	2019
On the Erdos-Sos Conjecture for Graphs on n=k+4 Vertices	1	0.37	2017
A Variation of the Erdős-Sós Conjecture in Bipartite Graphs.	0	0.34	2017
The Turán number of disjoint copies of paths.	3	0.53	2017
Note on extremal graphs with given matching number.	2	0.40	2017
Ordering connected graphs by their Kirchhoff indices.	2	0.40	2016
The Super Vertex-Graceful Labeling Of Graphs.	0	0.34	2016
Maximum atom-bond connectivity index with given graph parameters.	4	0.52	2016
The weighted tunable clustering in local-world networks with incremental behaviors	0	0.34	2012
Automorphism groups of the Pancake graphs	6	0.55	2012
The Laplacian Spectra of Graphs and Complex Networks	0	0.34	2011
A new entanglement measure: D-concurrence	0	0.34	2011
A Note on Eigenvalues of the Derangement Graph.	1	0.37	2011
Vertex degrees and doubly stochastic graph matrices	2	0.36	2011
Automorphism Group of the Derangement Graph.	4	0.45	2011
The signless Laplacian spectral radius of graphs with given degree sequences	9	0.98	2009
The Laplacian spectral radii of trees with degree sequences	16	1.52	2008
Spectral radii of graphs with given chromatic number	6	0.81	2007
Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees	16	2.13	2005
Bipartite density of cubic graphs	2	0.64	2003
Graphs with fourth Laplacian eigenvalue less than two	3	0.69	2003
On the spectral radius of graphs with cut vertices	15	3.89	2001