Search

The normalized distance Laplacian of a graph G is defined as D L (G) = T (G) − 1 / 2 (T (G) − D (G)) T (G) − 1 / 2 where D (G) is the matrix with pairwise distances between vertices and T (G) is the diagonal transmission matrix. In this project, we study the minimum and maximum spectral radii associated with this matrix, and the structures of the graphs that achieve these values. In particular, we prove a conjecture of Reinhart that the complete graph is the unique graph with minimum spectral radius, and we give several partial results towards a second conjecture of Reinhart regarding which graph has the maximum spectral radius. [ABSTRACT FROM AUTHOR]

Let ρ ( D ( G )) denote the distance spectral radius of a graph G and ∂ ( G → ) denote the distance signless Laplacian spectral radius of a digraph G → . Let G n , k D be the set of all k -connected graphs of order n with diameter D . In this paper, we first determine the unique graph with minimum distance spectral radius in G n , k D ; we then give sharp upper and lower bounds for the distance signless Laplacian spectral radius of strongly connected digraphs; we also characterize the digraphs having the maximal and minimal distance signless Laplacian spectral radii among all strongly connected digraphs; furthermore, we determine the extremal digraph with the minimal distance signless Laplacian spectral radius with given dichromatic number. [ABSTRACT FROM AUTHOR]

In this paper, we give a sufficient condition on the spectral radius for a graph to be Hamiltonian. [ABSTRACT FROM AUTHOR]

In the paper, we will determine the graphs with maximal spectral radius among all the trees with n vertices and independence number α for ⌈ n 2 ⌉ ≤ α ≤ n − 1 . [ABSTRACT FROM AUTHOR]

Let G=(V,E) be a simple connected weighted graph on n vertices, in which the edge weights are positive definite matrices. The eigenvalues of G are the eigenvalues of its adjacency matrix. In this note, we present a correction in equality part in Theorem 2 [S. Sorgun, S. Büyükköse, The new upper bounds on the spectral radius of weighted graphs, Appl. Math. Comput. 218 (2012) 5231–5238]. In addition, some related results are also provided. [ABSTRACT FROM AUTHOR]

Abstract: Let G be a simple connected graph of order n with degree sequence in non-increasing order. The signless Laplacian spectral radius of G is the largest eigenvalue of its signless Laplacian matrix . In this paper, we give a sharp upper bound on the signless Laplacian spectral radius in terms of , which improves and generalizes some known results. [Copyright &y& Elsevier]

Abstract: The distance spectral radius of a graph G is the largest eigenvalue of the distance matrix . In this paper, we characterize the graph with minimum distance spectral radius among trees with fixed number of pendent vertices. [Copyright &y& Elsevier]

Abstract: The spectral radius of a graph G is the largest eigenvalue of its adjacency matrix. Woo and Neumaier discovered that a connected graph G with is either a dagger, an open quipu, or a closed quipu. The reverse statement is not true. Many open quipus and closed quipus have spectral radii greater than . In this paper we proved the following results. For any open quipu G on n vertices () with spectral radius less than , its diameter satisfies . This bound is tight. For any closed quipu G on n vertices () with spectral radius less than , its diameter satisfies . The upper bound is tight while the lower bound is asymptotically tight. Let be a graph with minimal spectral radius among all connected graphs on n vertices with diameter D. For and , we proved that is the unique graph obtained by attaching two paths of lengths and to a pair of antipodal vertices of the even cycle . This result is tight. Thus we settled a conjecture of Cioabaˇ–van Dam–Koolen–Lee, who previously proved a special case for and n large enough. [Copyright &y& Elsevier]

Abstract: In this article, we determine the unique graph with maximal distance spectral radius in the class of graphs without a pendent vertex. [Copyright &y& Elsevier]

Abstract: In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized. In addition, these results disprove the two conjectures on the signless Laplacian spectral radius in [8]. [Copyright &y& Elsevier]

Abstract: Let denote the distance matrix of a connected graph with order , where is equal to the distance between and in . The largest eigenvalue of is called the distance spectral radius of graph , denoted by . In this paper, some graft transformations that decrease or increase are given. With them, for the graphs with both order and pendant vertices, the extremal graphs with the minimum distance spectral radius are completely characterized; the extremal graph with the maximum distance spectral radius is shown to be a dumbbell graph (obtained by attaching some pendant edges to each pendant vertex of a path respectively) when ; for , the extremal graphs with the maximum distance spectral radius are completely characterized. [Copyright &y& Elsevier]

Abstract: If G is a connected undirected simple graph on n vertices and edges, then G is called a c-cyclic graph. Specially, G is called a tricyclic graph if . Let be the maximum degree of G. In this paper, we determine the structural characterizations of the c-cyclic graphs, which have the maximum spectral radii (resp. signless Laplacian spectral radii) in the class of c-cyclic graphs on n vertices with fixed maximum degree . Moreover, we prove that the spectral radius of a tricyclic graph G strictly increases with its maximum degree when , and identify the first six largest spectral radii and the corresponding graphs in the class of tricyclic graphs on n vertices. [Copyright &y& Elsevier]

Abstract: Let G be a simple graph with vertices , of degrees , respectively. Let A be the -adjacency matrix of G and D be the diagonal matrix diag. is called the signless Laplacian of G. The largest eigenvalue of is called the signless Laplacian spectral radius or Q-spectral radius of G. Denote by the chromatic number for a graph G. In this paper, for graphs with order n, the extremal graphs with both the given chromatic number and the maximal Q-spectral radius are characterized, the extremal graphs with both the given chromatic number and the minimal Q-spectral radius are characterized as well. [Copyright &y& Elsevier]

Abstract: In this paper, we give some results on Laplacian spectral radius of graphs with cut vertices, and as their applications, we also determine the unique graph with the largest Laplacian spectral radius among all unicyclic graphs with vertices and diameter , . [ABSTRACT FROM AUTHOR]

Abstract: The independence number of is defined as the maximum cardinality of a set of pairwise non-adjacent vertices which is called an independent set. In this paper, we characterize the graphs which have the minimum spectral radius among all the connected graphs of order with independence number . [Copyright &y& Elsevier]

Abstract: A connected graph is called a quasi-k-cyclic graph, if there exists a vertex such that is a k-cyclic graph (connected with cyclomatic number k). In this paper we identify in the set of quasi-k-cyclic graphs (for ) those graphs whose spectral radius of the adjacency matrix (and the signless Laplacian if ) is the largest. In addition, for quasi-unicyclic graphs we identify as well those graphs whose spectral radius of the adjacency matrix is the second largest. [Copyright &y& Elsevier]

Abstract: A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency/Laplacian) spectral radius is a caterpillar. Counter examples show that the result cannot be generalized to the class of trees with a given (non-constant) degree sequence. [Copyright &y& Elsevier]

Abstract: We consider the set of unicyclic graphs with prescribed degree sequence. In this set we determine the (unique) graph with the largest spectral radius (or index) with respect to the adjacency matrix. In addition, we give a conjecture about the (unique) graph with the largest index in the set of connected graphs with prescribed degree sequence. [Copyright &y& Elsevier]

Abstract: Let be a graph with vertices and be the largest eigenvalue of the adjacency matrix of . We study how large can be when does not contain cycles and paths of specified order. In particular, we determine the maximum spectral radius of graphs without paths of given length, and give tight bounds on the spectral radius of graphs without given even cycles. We also raise a number of open problems. [Copyright &y& Elsevier]

Abstract: We study graphs with spectral radius at most and refine results by Woo and Neumaier [R. Woo, A. Neumaier, On graphs whose spectral radius is bounded by , Graphs Combinatorics 23 (2007) 713–726]. We study the limit points of the spectral radii of certain families of graphs, and apply the results to the problem of minimizing the spectral radius among the graphs with a given number of vertices and diameter. In particular, we consider the cases when the diameter is about half the number of vertices, and when the diameter is near the number of vertices. We prove certain instances of a conjecture posed by Van Dam and Kooij [E. R. Van Dam, R. E. Kooij, The minimal spectral radius of graphs with a given diameter, Linear Algebra Appl. 423 (2007) 408–419] and show that the conjecture is false for the other instances. [Copyright &y& Elsevier]

Abstract: The independence number of is defined as the maximum cardinality of a set of pairwise non-adjacent vertices which is called an independent set. In this paper, we characterize the graphs which have the minimum spectral radius among all the connected graphs of order with independence number . [Copyright &y& Elsevier]

Abstract: Let be the set of bicyclic graphs on vertices with girth . In this paper, we determine the unique graph with the maximal spectral radius among all graphs in . Moreover, the maximal spectral radius is a decreasing function on . [Copyright &y& Elsevier]