Results 251 to 260 of about 2,710,086 (272)
Some of the next articles are maybe not open access.
A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS
Discrete Mathematics, Algorithms and Applications, 2014We characterize graphs with minimal distance spectral radius in two classes of graphs: with vertex connectivity k and minimum degree at least k, and with given number of blocks. Moreover, we determine the unique graph that maximizes the distance spectral radius among all graphs with given clique number.
Milan Nath, Somnath Paul
openaire +3 more sources
The distance spectral radius of trees
Linear and Multilinear Algebra, 2017The unique graphs with maximum distance spectral radius among trees with given number of vertices of maximum degree and among homeomorphically irreducible trees, respectively, are determined.
Hongying Lin, Bo Zhou
openaire +1 more source
On distance spectral radius of hypergraphs
Linear and Multilinear Algebra, 2017AbstractThe distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. We propose some graft transformations that decrease or increase the distance spectral radius of a connected hypergraph that is not necessarily uniform. Then we determine the unique hypertrees with minimum and maximum distance spectral radius,
Yanna Wang, Bo Zhou
openaire +1 more source
Some graft transformations and its applications on the distance spectral radius of a graph [PDF]
Applied Mathematics Letters, 2012 Let D(G)=(di,j)n×n denote the distance matrix of a connected graph G with order n, where dij is equal to the distance between vi and vj in G. The largest eigenvalue of D(G) is called the distance spectral radius of graph G, denoted by ϱ(G). In this paper,
Guanglong Yu, Jinlong Shu
exaly +2 more sources
Some Properties on Resistance Distance Spectral Radius
Bulletin of the Iranian Mathematical Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Zhongxun, He, Fangguo
openaire +2 more sources
Distance spectral radius of the complements of trees with fixed parameters
Applied Mathematics and Computation, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kang Liu +3 more
openaire +3 more sources
ON THE MINIMAL DISTANCE SPECTRAL RADIUS IN THE CLASS OF BICYCLIC GRAPHS
Discrete Mathematics, Algorithms and Applications, 2014Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. The class of bicyclic graphs of order n, denoted by ℬn, can be partitioned into two subclasses: the class [Formula: see text] of graphs which contain induced ∞-graphs, and the class [Formula: see text] of graphs which contain induced θ-graphs ...
Milan Nath, Somnath Paul
openaire +3 more sources
ON THE MAXIMAL DISTANCE SPECTRAL RADIUS IN A CLASS OF BICYCLIC GRAPHS
Discrete Mathematics, Algorithms and Applications, 2012Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. Let Pp+1 = x1x2⋯xp+1, Pt+1 = y1y2⋯yt+1 and Pq+1 = z1z2⋯zq+1 be three vertex-disjoint paths. Identifying the initial vertices as u0 and the terminal vertices as v0, the resultant graph, denoted by θ(p; t; q), is called a θ-graph.
openaire +2 more sources
Distance Spectral Radius and Edge-Disjoint Spanning Trees
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dandan Fan, Rumeng He, Yanhua Zhao
openaire +3 more sources
Bounds for Resistance–Distance Spectral Radius
2014Lower and upper bounds as well as Nordhauss-Gaddum-type results forthe resistance–distance spectral radius are obtained.
MADEN, A. Dilek Güngör +2 more
openaire +1 more source