47 citations · 151 across the 69 of their papers we have counts for
7 papers · 1 filter
The spectral radius of graphs with no intersecting triangles
Sebastian Cioaba, Lihua Feng, Michael Tait +1
A graph on vertices consisting of triangles which intersect in exactly one common vertex is called a -fan and denoted by . This paper aims to determine the graph…
The normality and sum of normalities of trees
Ya-Hong Chen, Hua Wang, Xiao-Dong Zhang
The eccentricity of a vertex in a graph is the maximum distance from to any other vertex. The vertices whose eccentricity are equal to the diameter (the maximum eccentr…
On the signless Laplacian spectral radius of -minor free graphs
Ming-Zhu Chen, Xiao-Dong Zhang
In this paper, we prove that if is a -minor free graph of order with , the signless Laplacian spectral radius $q(G)\leq \frac{1}{2}(n+2t-2+\s…
Erdos-Gallai Stability Theorem for Linear Forests
Ming-Zhu Chen, Xiao-Dong Zhang
The Erdős-Gallai Theorem states that every graph of average degree more than contains a path of order for . In this paper, we obtain a stability version of the Er…
Anti-Ramsey numbers of graphs with some decomposition family sequences
Long-Tu Yuan, Xiao-Dong Zhang
For a given graph , the anti-Ramsey number of is the maximum number of colors in an edge-coloring of a complete graph which does not contain a rainbow copy of . In this p…
Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum
Abraham Berman, Shaked-Monderer, Ranveer Singh +1
It is known that complete multipartite graphs are determined by their distance spectrum but not by their adjacency spectrum. The Seidel spectrum of a graph on more than one ver…