Results 31 to 40 of about 222 (137)
Seidel Laplacian and Seidel Signless Laplacian Energies of Commuting Graph for Dihedral Groups [PDF]
Malaysian Journal of Fundamental and Applied SciencesIn 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. The spectrum of the graph is associated with the Seidel Laplacian and Seidel signless Laplacian matrices.
Mamika Ujianita Romdhini +2 more
openaire +2 more sources
Color Laplacian and Color Signless Laplacian Energy of Complement of Subgroup Graph of Dihedral Group [PDF]
Proceedings of the Proceedings of the 2nd International Conference on Quran and Hadith Studies Information Technology and Media in Conjunction with the 1st International Conference on Islam, Science and Technology, ICONQUHAS & ICONIST, Bandung, October 2-4, 2018, Indonesia, 2018 Laplacian and signless laplacian energy of a finite graph is the most interesting topics on areas of energy of a graph. The new concept of energy of a graph is color energy and furthermore color laplacian and color signless laplacian energy.
Lila Aryani Puspitasari +3 more
openaire +3 more sources
Signless Laplacian energies of non-commuting graphs of finite groups and related results
Discrete Mathematics, Algorithms and Applications, 2023 The non-commuting graph of a non-abelian group [Formula: see text] with center [Formula: see text] is a simple undirected graph whose vertex set is [Formula: see text] and two vertices [Formula: see text] are adjacent if [Formula: see text]. In this paper, we compute Signless Laplacian spectrum and Signless Laplacian energy of non-commuting graphs of ...
Monalisha Sharma, Rajat Kanti Nath
openaire +3 more sources
Signless Laplacian energy, distance Laplacian energy and distance signless Laplacian spectrum of unitary addition Cayley graphs [PDF]
Linear and Multilinear Algebra, 2021 In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}.
P., Naveen, A. V, Chithra
openaire +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\).
Alhevaz, Abdolla +2 more
openaire +1 more source
The Laplacian and signless Laplacian energy of a graph under perturbation [PDF]
AIP Conference Proceedings, 2020 In this paper, we find energy, Laplacian energy and signless Laplacian energy of a complete graph when perturbed by adding some vertices and edges.
E. Nandakumar, R. Venkatesan, A. Yasmin
openaire +1 more source
On graphs with minimal distance signless Laplacian energy [PDF]
Acta Universitatis Sapientiae, Mathematica, 2021 Abstract For a simple connected graph G of order n having distance signless Laplacian eigenvalues ρ
Pirzada S. +3 more
openaire +3 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 +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 +4 more
wiley +1 more source