Results 41 to 50 of about 6,799 (133)
On the Signless Laplacian ABC-Spectral Properties of a Graph
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G. We give
B. Rather, H. A. Ganie, Y. Shang
semanticscholar +3 more sources
Seidel Laplacian and Seidel Signless Laplacian Energies of Commuting Graph for Dihedral Groups
In this paper, we discuss the energy of the commuting graph. The vertex set of the graph is dihedral groups and the edges between two distinct vertices represent the commutativity of the group elements.
M. Romdhini +2 more
semanticscholar +2 more sources
Common neighborhood (signless) Laplacian spectrum and energy of CCC-graph
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 +3 more sources
Novel Concept of Energy in Bipolar Single-Valued Neutrosophic Graphs with Applications
The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Recently, there has been a lot of interest in graph energy research.
Siti Nurul Fitriah Mohamad +3 more
doaj +1 more source
On the signless Laplacian energy and signless Laplacian Estrada index of extremal graphs
R. Binthiya, P. B. Sarasija
semanticscholar +2 more sources
On Distance Signless Laplacian Estrada Index and Energy of Graphs [PDF]
Summary: For a connected graph \(G\), the distance signless Laplacian matrix is defined as \(D^Q(G)=\mathrm{Tr}(G)+D(G)\), where \(D(G)\) is the distance matrix of \(G\) and \(\mathrm{Tr}(G)\) is the diagonal matrix of vertex transmissions of \(G\).
Alhevaz, Abdolla +2 more
openaire +1 more source
New Bounds for the Generalized Distance Spectral Radius/Energy of Graphs
Let G be a simple connected graph with vertex set V(G) = {v1, v2, …, vn} and dvi be the degree of the vertex vi. Let D(G) be the distance matrix and Tr(G) be the diagonal matrix of the vertex transmissions of G. The generalized distance matrix of G is defined as Dα(G) = αTr(G) + (1 − α)D(G), where 0 ≤ α ≤ 1. If λ1, λ2, …, λn are the eigenvalues of Dα(G)
Yuzheng Ma +3 more
wiley +1 more source
On Laplacian Equienergetic Signed Graphs
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal. In this paper, we present several infinite families of Laplacian equienergetic signed graphs.
Qingyun Tao, Lixin Tao, Yongqiang Fu
wiley +1 more source
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
A connected graph is called Hamilton‐connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton‐connected is an NP‐complete problem. Hamiltonian and Hamilton‐connected graphs have diverse applications in computer science and electrical engineering.
Sakander Hayat +4 more
wiley +1 more source
Laplacian and signless laplacian spectra and energies of multi-step wheels
<abstract> <p>Energies and spectrum of graphs associated to different linear operators play a significant role in molecular chemistry, polymerisation, pharmacy, computer networking and communication systems. In current article, we compute closed forms of signless Laplacian and Laplacian spectra and energies of multi-step wheel networks < ...
Zheng-Qing Chu +4 more
openaire +4 more sources

