Results 121 to 130 of about 68,836 (161)

The Signless Laplacian Spread of Power Graphs of Finite Groups

Ikonion journal of mathematics
Given a finite group G, let P(G) denote the power graph of the group G. Let Q(G) denote the signless Laplacian matrix of a graph G. Moreover, let λ1 and λn denote the largest and smallest eigenvalues of Q(G).
Subarsha Banerjee
semanticscholar   +1 more source

Comparison of Different Properties of Graph Using Adjacency Matrix and Signless Laplacian Matix

International Journal of Scientific Research in Science Engineering and Technology
This study highlights the advantages of using the Signless Laplacian spectrum over the traditional Adjacency matrix spectrum for graph representation.
Km. Priti Sahrawat, Dr. Ashish Kumar
semanticscholar   +1 more source

Domination number and (signless Laplacian) spectral radius of cactus graphs

The Electronic Journal of Linear Algebra
A cactus graph is a connected graph whose block is either an edge or a cycle. A vertex set $S\subseteq V(G)$ is said to be a dominating set of a graph $G$ if every vertex in $V(G)\setminus S$ is adjacent to a vertex in $S$.
Yaqi Cui, Yuanyuan Chen, Dan Li, Yue Zhang   +3 more
semanticscholar   +1 more source

Maximum signless Laplacian Estrada index of tetracyclic graphs

Filomat
In this study, we aim to determine the unique tetracyclic graph that maximizes the signless Laplacian Estrada index (SLEE) among all tetracyclic graphs. The SLEE of a graph ?
Palaniyappan Nithya, S. Elumalai, Selvaraj Balachandran, Hechao Liu   +3 more
semanticscholar   +1 more source

On the Energy and Spread of the Adjacency, Laplacian and Signless Laplacian Matrices of Graphs

Match-communications in Mathematical and in Computer Chemistry
In this paper, we explore the connection between the energy and spread of the adjacency, Laplacian, and signless Laplacian matrices for graphs. We then introduce new limitations for the energy and spread of these matrices, based on previous research and ...
K. Das, A. Ghalavand, M. Tavakoli
semanticscholar   +1 more source

On the eigenvalues of the distance signless Laplacian matrix of graphs

Proyecciones (Antofagasta)
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.
A. Jahanbani, Hajar Shooshtari, Mohd Irshad Ul Haq, S. Pirzada   +3 more
semanticscholar   +1 more source

Distance signless Laplacian eigenvalues of graphs

Frontiers of Mathematics in China, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Kinkar Chandra, Lin, Huiqiu, Guo, Jiming   +2 more
openaire   +1 more source

Laplacian and signless Laplacian spectrum of commuting graphs of finite groups

2018
Summary: The commuting graph of a finite non-abelian group \(G\) with center \(Z(G)\), denoted by \(\Gamma_G\), is a simple undirected graph whose vertex set is \(G\setminus Z(G)\), and two distinct vertices \(x\) and \(y\) are adjacent if and only if \(xy = yx\).
Dutta, Jutirekha, Nath, Rajat
openaire   +2 more sources

An odd [1, b]-factor in a graph from signless Laplacian spectral radius

RAIRO Oper. Res.
An odd [1,b]-factor of a graph G is a spanning subgraph F of G such that dF(v) is odd and 1 ≤ dF(v) ≤ b for every v ∈ V (G), where b is a positive odd integer. The matrix Q(G) = D(G) + A(G) is called the signless Laplacian matrix of G, where D(G) denotes
Sizhong Zhou, Quanru Pan
semanticscholar   +1 more source

Common neighborhood (signless) Laplacian spectrum and energy of CCC-graph

Boletim da Sociedade Paranaense de Matemática
In this paper, we consider commuting conjugacy class graph (abbreviated as CCC-graph) of a finite group $G$ which is a graph with vertex set $\{x^G : x \in G \setminus Z(G)\}$ (where $x^G$ denotes the conjugacy class containing $x$) and two distinct ...
Firdous Ee Jannat, R. K. Nath
semanticscholar   +1 more source