scholarly journals Minimum dominating signless laplacian graph energy

2020 ◽  
Vol 1597 ◽  
pp. 012044
Author(s):  
Kavita Permi
2017 ◽  
Vol 3 (5) ◽  
pp. 322-331
Author(s):  
Reza Sharafdini ◽  
Alireza Ataei ◽  
Habibeh Panahbar

2020 ◽  
Vol 12 (06) ◽  
pp. 2050078
Author(s):  
Fateme Movahedi

Let [Formula: see text] be a graph of the order [Formula: see text] and size [Formula: see text]. The minimum edge dominating energy is defined as the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of the graph [Formula: see text]. In this paper, we establish relations between the minimum edge dominating energy of a graph [Formula: see text] and the graph energy, the energy of the line graph, signless Laplacian energy of [Formula: see text].


Author(s):  
Yi-Zhe Song ◽  
Pablo Arbelaez ◽  
Peter Hall ◽  
Chuan Li ◽  
Anupriya Balikai
Keyword(s):  

Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 172
Author(s):  
Siti Nurul Fitriah Mohamad ◽  
Roslan Hasni ◽  
Florentin Smarandache ◽  
Binyamin Yusoff

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. Previous literature has suggested integrating energy, Laplacian energy, and signless Laplacian energy with single-valued neutrosophic graphs (SVNGs). This integration is used to solve problems that are characterized by indeterminate and inconsistent information. However, when the information is endowed with both positive and negative uncertainty, then bipolar single-valued neutrosophic sets (BSVNs) constitute an appropriate knowledge representation of this framework. A BSVNs is a generalized bipolar fuzzy structure that deals with positive and negative uncertainty in real-life problems with a larger domain. In contrast to the previous study, which directly used truth and indeterminate and false membership, this paper proposes integrating energy, Laplacian energy, and signless Laplacian energy with BSVNs to graph structure considering the positive and negative membership degree to greatly improve decisions in certain problems. Moreover, this paper intends to elaborate on characteristics of eigenvalues, upper and lower bound of energy, Laplacian energy, and signless Laplacian energy. We introduced the concept of a bipolar single-valued neutrosophic graph (BSVNG) for an energy graph and discussed its relevant ideas with the help of examples. Furthermore, the significance of using bipolar concepts over non-bipolar concepts is compared numerically. Finally, the application of energy, Laplacian energy, and signless Laplacian energy in BSVNG are demonstrated in selecting renewable energy sources, while optimal selection is suggested to illustrate the proposed method. This indicates the usefulness and practicality of this proposed approach in real life.


2020 ◽  
Vol 1597 ◽  
pp. 012031
Author(s):  
Kavita Permi ◽  
H S Manasa ◽  
M C Geetha

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 512
Author(s):  
Maryam Baghipur ◽  
Modjtaba Ghorbani ◽  
Hilal A. Ganie ◽  
Yilun Shang

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph Kn and the graph Kn−e obtained from Kn by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.


Sign in / Sign up

Export Citation Format

Share Document