Results 61 to 70 of about 33,403 (178)

On spectral radius of the generalized distance matrix of a graph [PDF]

Discrete Mathematics Letters, 2021
Shariefuddin Pirzada
doaj   +1 more source

Connectivity, diameter, independence number and the distance spectral radius of graphs

, 2017
© 2017 Elsevier Inc. The distance spectral radius of a graph is the largest eigenvalue of its distance matrix. X.L. Zhang (2012) [31] determined the n-vertex graphs of given diameter with the minimum distance spectral radius. In this paper, we generalize
Zhang M., Gutman, Ivan, Li A.
core   +1 more source

On the distance signless Laplacian spectral radius of graphs and digraphs

, 2017
Let \eta(G) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper,bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless ...
Li, Dan, Jixiang Meng, Meng, Jixiang, Guoping Wang, Dan Li, Wang, Guoping   +5 more
core   +1 more source

Spatial spectral and energy efficiencies of cellular networks limited by co-channel interference and path loss in Nakagami-m fading environment

EURASIP Journal on Wireless Communications and Networking, 2018
A comprehensive framework for design of hexagonal cellular network system in terms of spatial spectral and energy efficiencies is presented. The communication environment in the system is assumed to be Nakagami-m fading coupled with simplified path loss ...
Abdulbaset M. Hamed, Raveendra K. Rao
doaj   +1 more source

Distance spectral radius of uniform hypergraphs

Linear Algebra and its Applications, 2016
We study the effect of three types of graft transformations to increase or decrease the distance spectral radius of uniform hypergraphs, and we determined the unique $k$-uniform hypertrees with maximum, second maximum, minimum and second minimum distance spectral radius, respectively.
Hongying Lin, Bo Zhou
openaire   +3 more sources

The distance spectral radius of graphs with given number of odd vertices

, 2016
The graphs with smallest, respectively largest, distance spectral radius among the connected graphs, respectively trees with a given number of odd vertices, are determined. Also, the graphs with the largest distance spectral radius among the trees with a
Zhou, Bo, Lin, Hongying
core   +1 more source

Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]

Discrete Mathematics Letters, 2022
Saleem Khan, Shariefuddin Pirzada
doaj   +1 more source

On the distance Laplacian spectral radius of graphs

Linear Algebra and its Applications, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Hongying, Zhou, Bo
openaire   +1 more source

Developments on Spectral Characterizations of Graphs

In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core   +2 more sources

The distance Seidel matrix of connected graphs

AKCE International Journal of Graphs and Combinatorics
For a connected graph G, we present the concept of a new graph matrix related to its distance and Seidel matrix, called distance Seidel matrix [Formula: see text]. Suppose that the eigenvalues of [Formula: see text] be [Formula: see text] In this article,
T. Haritha, A. V. Chithra
doaj   +1 more source