AbstractWe characterize the graphs which achieve the maximum value of the spectral radius of the adjacency matrix in the sets of all graphs with a given domination number and graphs with no isolated vertices and a given domination number
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractWe characterize the graphs which achieve the maximum value of the spectral radius of the adj...
Let $G_{n,\gamma}$ be the set of all connected graphs on $n$ vertices with domination number $\gamma...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
[[abstract]]By the signless Laplacian of a (simple) graphG we mean the matrix Q(G) = D(G)+A(G), wher...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
Let G(n,α) be the class of block graphs on n vertices and prescribed independence number α. In this ...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractWe characterize the graphs which achieve the maximum value of the spectral radius of the adj...
Let $G_{n,\gamma}$ be the set of all connected graphs on $n$ vertices with domination number $\gamma...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
AbstractWe study the spectral radius of graphs with n vertices and k cut vertices and describe the g...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
[[abstract]]By the signless Laplacian of a (simple) graphG we mean the matrix Q(G) = D(G)+A(G), wher...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
Let G(n,α) be the class of block graphs on n vertices and prescribed independence number α. In this ...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
DOI
Add to ORKG