Results 151 to 160 of about 33,403 (178)

ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS

Bulletin of the Australian Mathematical Society, 2023
AbstractWe first establish a lower bound on the size and spectral radius of a graph G to guarantee that G contains a fractional perfect matching. Then, we determine an upper bound on the distance spectral radius of a graph G to ensure that G has a fractional perfect matching.
SHUCHAO LI, SHUJING MIAO, MINJIE ZHANG
openaire   +2 more sources

Some graft transformations and its applications on the distance spectral radius of a graph

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

GRAPH TRANSFORMATION AND DISTANCE SPECTRAL RADIUS

Discrete Mathematics, Algorithms and Applications, 2013
Trees are very common in the theory and applications of combinatorics. In this paper, we consider graphs whose underlying structure is a tree and study the behavior of the distance spectral radius under a graph transformation. As an application, we find the corona tree that maximizes the distance spectral radius among all corona trees with a fixed ...
Milan Nath, Somnath Paul
openaire   +1 more source

Maximal distance spectral radius of trees

Discrete Mathematics, Algorithms and Applications, 2019
In this paper, we determine the unique tree that maximizes the distance spectral radius in the class of all trees in which each non-pendent vertex has degree at least [Formula: see text].
S. S. Bose, Milan Nath, Deepak Sarma
openaire   +2 more sources

On generalized distance spectral radius and generalized distance energy of graphs

Discrete Mathematics, Algorithms and Applications, 2022
For a simple connected graph [Formula: see text], let [Formula: see text] and [Formula: see text] be the distance matrix and the diagonal matrix of the vertex transmissions, respectively. The convex linear combination [Formula: see text] of [Formula: see text] and [Formula: see text] is defined as, [Formula: see text], [Formula: see text]. The matrix [
Zia Ullah Khan, Xiao-Dong Zhang 0001
openaire   +2 more sources

A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS

Discrete Mathematics, Algorithms and Applications, 2014
We 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   +2 more sources

The distance spectral radius of trees

Linear and Multilinear Algebra, 2017
The 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 adjacency-distance spectral radius and spread of graphs

Applied Mathematics and Computation, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haiyan Guo, Bo Zhou 0007
openaire   +1 more source

On distance spectral radius of hypergraphs

Linear and Multilinear Algebra, 2017
AbstractThe 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 Properties on Resistance Distance Spectral Radius

Bulletin of the Iranian Mathematical Society, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Zhongxun, He, Fangguo
openaire   +2 more sources