Results 101 to 110 of about 110,880 (163)

On maximum degree (signless) Laplacian matrix of a graph

, 2022
Let G be a simple graph on n vertices and v1, v2, . . . , vn be the vertices ofG. We denote the degree of a vertex vi in G by dG(vi) = di. The maximumdegree matrix of G, denoted by M(G), is the real symmetric matrix withits ijth entry equal to max{di, dj}
Raghu, V. D., Rangarajan, R., Rakshith , B. R.   +2 more
core   +1 more source

Adjacency spectra and Laplacian integrality of zero divisor graphs over some rings

Kuwait Journal of Science
Let 𝑅 be a commutative ring and let 𝑍∗ (𝑅) denote the set of non-zero zero divisors of 𝑅. The zero divisor graph 𝛤(𝑅) is defined as the simple graph with vertex set 𝑍∗ (𝑅), where two distinct vertices 𝑥, 𝑦 ∈ 𝑍∗ (𝑅) are adjacent if and only if 𝑥𝑦 = 0.
Bilal Ahmad Rather, Parvez Ali, M. Imran, A. Kothepeda   +3 more
doaj   +1 more source

BOUNDS FOR SIGNLESS LAPLACIAN SPECTRAL RADIUS

, 2018
We consider weighted graphs, such as graphs where the edge weights are positive definite matrices of the same order in this paper. The signless Laplacian eigenvalues of a graph are the eigenvalues of the signless Laplacian matrix of a graph G.
Nurkahli, Semiha Basdas, Kizilca, Fatma, Kabatas, Ulkunur   +2 more
core  

Quantitative structure-properties relationship analysis of Eigen-value-based indices using COVID-19 drugs structure. [PDF]

Int J Quantum Chem, 2023
Rauf A, Naeem M, Hanif A.
europepmc   +1 more source

On the eigenvalues of the distance signless Laplacian matrix of graphs

Let G be a connected graph and let DQ(G) be the distance signless Laplacian matrix of G with eigenvalues ρ1≥ ρ2≥…≥ ρn. The spread of the matrix DQ}(G) is defined as s(DQ(G)) := maxi,j| ρi-ρj| = ρ1- ρn.
Shooshtari, Hajar, Jahanbani, Akbar, Haq, Mohd Abrar Ul, Pirzada, Shariefuddin   +3 more
core   +1 more source

Transmission-Based Energies of Prime Coprime Graph for Integers Modulo Group

Science and Technology Indonesia
Graphs are an excellent instrument that provides an algebraic structure for visualizing and interpreting molecule structures and characteristics. As a result, the problem statement arises regarding how we can interpret graphs with eigenvalues concerning
Mamika Ujianita Romdhini, Abdurahim, Andika Ellena Saufika Hakim Maharani, Siti Raudhatul Kamali   +3 more
doaj   +1 more source

Eigenvalue-based entropy in directed complex networks. [PDF]

PLoS One, 2021
Sun Y, Zhao H, Liang J, Ma X.
europepmc   +1 more source

The least eigenvalue of the signless Laplacian of the complements of trees

Linear Algebra and its Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Shuchao, Wang, Shujing
openaire   +1 more source

Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation. [PDF]

Front Chem, 2023
Munir MM, Wusqa UT.
europepmc   +1 more source

Further results on the distance signless Laplacian spectrum of graphs

, 2018
The distance signless Laplacian matrix [Formula: see text] of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix
Abdollah Alhevaz, Ebrahim Hashemi, Maryam Baghipur   +2 more
core   +1 more source