Results 1 to 10 of about 6,081 (145)

On the spectral radius and energy of signless Laplacian matrix of digraphs [PDF]

open access: goldHeliyon, 2022
Let D be a digraph of order n and with a arcs. The signless Laplacian matrix Q(D) of D is defined as Q(D)=Deg(D)+A(D), where A(D) is the adjacency matrix and Deg(D) is the diagonal matrix of vertex out-degrees of D.
Hilal A. Ganie, Yilun Shang
doaj   +8 more sources

On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy [PDF]

open access: goldMathematics, 2020
In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph.
Luis Medina, Hans Nina, Macarena Trigo
doaj   +4 more sources

Color signless Laplacian energy of graphs

open access: goldAKCE International Journal of Graphs and Combinatorics, 2017
In this paper, we introduce the new concept of color Signless Laplacian energy . It depends on the underlying graph and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families
Pradeep G. Bhat, Sabitha D’Souza
doaj   +4 more sources

Signless Laplacian energy aware decision making for electric car batteries based on intuitionistic fuzzy graphs. [PDF]

open access: diamondSci Prog
Fuzzy graphs (FGs) contain dual-nature characteristics that may be extended to intuitionistic fuzzy graphs. These FGs are better at capturing ambiguity in situations in reality involving decision-making than FGs. In this paper, we address decision-making
Mohamed Atheeque A, Sharief Basha S.
europepmc   +5 more sources

Seidel Signless Laplacian Energy of Graphs [PDF]

open access: closedMathematics Interdisciplinary Research, 2017
Let S(G) be the Seidel matrix of a graph G of order n and let DS(G)=diag(n-1-2d1, n-1-2d2,..., n-1-2dn) be the diagonal matrix with d_i denoting the degree of a vertex v_i in G.
Harishchandra Ramane   +3 more
doaj   +4 more sources

Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy [PDF]

open access: goldMathematics
Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new
Luis Medina   +2 more
doaj   +4 more sources

On graphs with minimal distance signless Laplacian energy [PDF]

open access: diamondActa Universitatis Sapientiae, Mathematica, 2021
For a simple connected graph G of order n having distance signless Laplacian eigenvalues ρ1Q≥ρ2Q≥⋯≥ρnQ \rho _1^Q \ge \rho _2^Q \ge \cdots \ge \rho _n^Q , the distance signless Laplacian energy DSLE(G) is defined as DSLE(G)=∑i=1n| ρiQ-2W(G)n | DSLE\left ...
S. Pirzada   +3 more
semanticscholar   +5 more sources

Signless Laplacian energy, Distance Laplacian Energy and Distance Signless Laplacian Spectrum of Unitary Addition Cayley Graphs [PDF]

open access: greenLinear 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} $ Gn.
Naveen Palanivel   +1 more
semanticscholar   +7 more sources

Signless Laplacian energy of a first KCD matrix [PDF]

open access: diamondActa Universitatis Sapientiae, Informatica, 2022
The concept of first KCD signless Laplacian energy is initiated in this article. Moreover, we determine first KCD signless Laplacian spectrum and first KCD signless Laplacian energy for some class of graphs and their complement.
Keerthi G. Mirajkar, Akshata Morajkar
semanticscholar   +4 more sources

Applications on color (distance) signless laplacian energy of annihilator monic prime graph of commutative rings

open access: goldAin Shams Engineering Journal, 2023
In this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj   +3 more sources

Home - About - Disclaimer - Privacy