Results 51 to 60 of about 222 (137)

New upper bounds for the energy and signless Laplacian energy of a graph [PDF]

International Journal of Advances in Applied Mathematics and Mechanics, 2015
Rao Li
doaj   +1 more source

The minimum covering signless laplacian energy of graph

Journal of Physics: Conference Series, 2020
Abstract Gutman [5]has come out with the idea of graph energy as summation of numerical value of latent roots of the adjacency matrix of the given graph Γ. In this paper, we introduce the Minumum Covering Signless Laplacian energy
Kavita Permi, H S Manasa, M C Geetha
openaire   +1 more source

On the Boundary of Incidence Energy and Its Extremum Structure of Tricycle Graphs

Frontiers in Physics, 2020
With the wide application of graph theory in circuit layout, signal flow chart and power system, more and more attention has been paid to the network topology analysis method of graph theory.
Hongyan Lu, Zhongxun Zhu
doaj   +1 more source

On Normalized Signless Laplacian Resolvent Energy

Kragujevac Journal of Mathematics
Summary: Let \(G\) be a simple connected graph with \(n\) vertices. Denote by \(\mathcal{L}^+(G) =D(G)^{-1/2}Q(G) D(G)^{-1/2}\) the normalized signless Laplacian matrix of graph \(G\), where \(Q(G)\) and \(D(G)\) are the signless Laplacian and diagonal degree matrices of \(G\), respectively. The eigenvalues of matrix \(\mathcal{L}^+(G)\), \(2=\gamma_1^+
Altindağ, Ş. B. Bozkurt, Milovanović, I., Milovanović, E., Matejić, M.   +3 more
openaire   +2 more sources

Resistance Distance and Kirchhoff Index for a Class of Graphs

Mathematical Problems in Engineering, Volume 2018, Issue 1, 2018., 2018
Let G[F, Vk, Hv] be the graph with k pockets, where F is a simple graph of order n ≥ 1, Vk = {v1, v2, …, vk} is a subset of the vertex set of F, Hv is a simple graph of order m ≥ 2, and v is a specified vertex of Hv. Also let G[F, Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek = {e1, e2, …ek} is a subset of the ...
WanJun Yin, ZhengFeng Ming, Qun Liu, Jean Jacques Loiseau   +3 more
wiley   +1 more source

LAPLACIAN SPECTRUM AND ENERGY OF NON-COMMUTING GRAPHS OF FINITE RINGS [PDF]

Journal of Algebraic Systems
We compute spectrum, energy, Laplacian spectrum/ energy and signless Laplacian spectrum/energy of non-commuting graphs of certain finite non-commutative rings. In particular, we consider finite rings $R$ such that $|R| = p^2, p^3, p^4$, $p^5$, $p^2q$ and
Monalisha Sharma, Rajat Nath
doaj   +1 more source

On α-adjacency energy of graphs and Zagreb index

AKCE International Journal of Graphs and Combinatorics, 2021
Let A(G) be the adjacency matrix and D(G) be the diagonal matrix of the vertex degrees of a simple connected graph G. Nikiforov defined the matrix of the convex combinations of D(G) and A(G) as for If are the eigenvalues of (which we call α-adjacency ...
S. Pirzada, Bilal A. Rather, Hilal A. Ganie, Rezwan ul Shaban   +3 more
doaj   +1 more source

Construction of Albertson Cospectral and Albertson Equienergetic Graphs Using Graph Operations

Journal of Mathematics, Volume 2026, Issue 1, 2026.
The energy of a graph is an invariant calculated as the sum of the absolute eigenvalues of its adjacency matrix. This concept extends to various types of energies derived from different graph‐related matrices. This paper explores the spectral properties of Albertson energy and Albertson spectra.
Jane Shonon Cutinha, Sabitha D’Souza, Swati Nayak, G Muhiuddin   +3 more
wiley   +1 more source

Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints

Journal of Mathematics
For a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj   +1 more source

Investigating Signless Laplacian Spectra and Network Topology in Helical Phenylene‐Quadrilateral Structures

Journal of Mathematics, Volume 2025, Issue 1, 2025.
This study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis. Motivated by the need to understand how helical topology influences network dynamics and robustness, we derive exact analytical expressions for three key ...
Fareeha Hanif, Ali Raza, Md. Shajib Ali, Pramita Mishra   +3 more
wiley   +1 more source