AbstractIn this paper, the first five sharp upper bounds on the spectral radii of unicyclic graphs with fixed matching number are presented. The first ten spectral radii over the class of unicyclic graphs on a given number of vertices and the first four spectral radii of unicyclic graphs with perfect matchings are also given, respectively
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all unifo...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractIf G is a connected undirected simple graph on n vertices and n+c-1 edges, then G is called ...
AbstractIn this paper, the first five sharp upper bounds on the spectral radii of unicyclic graphs w...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractThis paper presents a simple method to order trees, unicyclic graphs and bicyclic graphs acc...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), ...
The spectral radius of a graph is defined by that of its unoriented Laplacian matrix. In this paper,...
Let $d_{v_{i}}$ be the degree of the vertex $v_{i}$ of $G$. The arithmetic-geometric matrix $A_{ag}(...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
AbstractWe consider the set of unicyclic graphs with prescribed degree sequence. In this set we dete...
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all unifo...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractIf G is a connected undirected simple graph on n vertices and n+c-1 edges, then G is called ...
AbstractIn this paper, the first five sharp upper bounds on the spectral radii of unicyclic graphs w...
Abstract. In this paper, we first present the properties of the graph which maximize the spectral ra...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractThis paper presents a simple method to order trees, unicyclic graphs and bicyclic graphs acc...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the unicyclic ...
G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), ...
The spectral radius of a graph is defined by that of its unoriented Laplacian matrix. In this paper,...
Let $d_{v_{i}}$ be the degree of the vertex $v_{i}$ of $G$. The arithmetic-geometric matrix $A_{ag}(...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
AbstractWe consider the set of unicyclic graphs with prescribed degree sequence. In this set we dete...
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all unifo...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractIf G is a connected undirected simple graph on n vertices and n+c-1 edges, then G is called ...
DOI
Add to ORKG