Results 21 to 30 of about 7,057,923 (115)

Sharp Bounds on (Generalized) Distance Energy of Graphs

Mathematics, 2020
Given a simple connected graph G, let D ( G ) be the distance matrix, D L ( G ) be the distance Laplacian matrix, D Q ( G ) be the distance signless Laplacian matrix, and T r ( G ) be the vertex transmission ...
Abdollah Alhevaz, Maryam Baghipur, Kinkar Ch. Das, Yilun Shang   +3 more
doaj   +2 more sources

On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs

Discrete Applied Mathematics, 2017
Let G be a graph of order n . The energy E ( G ) of a simple graph G is the sum of absolute values of the eigenvalues of its adjacency matrix. The Laplacian energy, the signless Laplacian energy and the distance energy of graph G are denoted by L E ( G )
K. Das, M. Aouchiche, P. Hansen
semanticscholar   +4 more sources

ENERGY OF NON-COPRIME GRAPH ON MODULO GROUP

Barekeng
A graph is a mathematical structure consisting of a non-empty set of vertices and a set of edges connecting these vertices. In recent years, extensive research on graphs has been conducted, with one of the intriguing topics being the representation of ...
Gusti Yogananda Karang, I Gede Adhitya Wisnu Wardhana, Manimaran Angamuthu   +2 more
doaj   +2 more sources

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   +2 more sources

On Distance Signless Laplacian Estrada Index and Energy of Graphs [PDF]

Kragujevac Journal of Mathematics, 2021
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\).
Abdollah Alhevaz, M. Baghipur, D. S. Pirzada   +2 more
semanticscholar   +2 more sources

On the signless Laplacian and normalized signless Laplacian spreads of graphs [PDF]

, 2023
summary:Let $G=(V,E)$, $V=\{v_1,v_2,\ldots ,v_n\}$, be a simple connected graph with $n$ vertices, $m$ edges and a sequence of vertex degrees $d_1\geq d_2\geq \cdots \geq d_n$.
Milovanović, Emina, Bozkurt Altindağ, Serife B., Matejić, Marjan, Milovanović, Igor   +3 more
core   +2 more sources

New Bounds for the Generalized Distance Spectral Radius/Energy of Graphs

Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022
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, Yubin Gao, Yanling Shao, Yusuf Gurefe   +3 more
wiley   +1 more source

On Laplacian Equienergetic Signed Graphs

Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021
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

Complexity, Volume 2021, Issue 1, 2021., 2021
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, Asad Khan, Suliman Khan, Jia-Bao Liu, M. Irfan Uddin   +4 more
wiley   +1 more source

Some Chemistry Indices of Clique‐Inserted Graph of a Strongly Regular Graph

Complexity, Volume 2021, Issue 1, 2021., 2021
In this paper, we give the relation between the spectrum of strongly regular graph and its clique‐inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique‐inserted graph of strongly regular graph are calculated. We also give formulae expressing the energy, Kirchoff index, and the number of spanning trees of clique‐inserted ...
Chun-Li Kan, Ying-Ying Tan, Jia-Bao Liu, Bao-Hua Xing, Huihua Chen   +4 more
wiley   +1 more source