On the Signless Laplacian Spectral Radius of Graphs without Small Books and Intersecting Quadrangles [PDF]
Mathematics, 2022 In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do not contain small books as a subgraph and characterize all extremal graphs. In addition, we give an upper bound of the signless Laplacian spectral radius of
Ming-Zhu Chen +3 more
doaj +2 more sources
On the spectral radius and energy of signless Laplacian matrix of digraphs [PDF]
Heliyon, 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 +2 more sources
Signless Laplacian energy aware decision making for electric car batteries based on intuitionistic fuzzy graphs. [PDF]
Sci ProgFuzzy 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 +2 more sources
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
doaj +2 more sources
On the Signless Laplacian Spectral Radius of Bicyclic Graphs with Perfect Matchings [PDF]
The Scientific World Journal, 2014 The graph with the largest signless Laplacian spectral radius among all bicyclic graphs with perfect matchings is determined.
Jing-Ming Zhang +2 more
doaj +2 more sources
On comparison between the distance energies of a connected graph [PDF]
HeliyonLet G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie +2 more
doaj +2 more sources
On the sum of signless Laplacian spectra of graphs
Karpatsʹkì Matematičnì Publìkacìï, 2019 For a simple graph $G(V,E)$ with $n$ vertices, $m$ edges, vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$ and edge set $E(G)=\{e_1, e_2,\dots, e_m\}$, the adjacency matrix $A=(a_{ij})$ of $G$ is a $(0, 1)$-square matrix of order $n$ whose $(i,j)$-entry is ...
S. Pirzada, H.A. Ganie, A.M. Alghamdi
doaj +3 more sources
A Spectrum-Based Approach to Network Analysis Utilizing Laplacian and Signless Laplacian Spectra to Torus Networks [PDF]
IEEE AccessExploring the applications of Laplacian and signless Laplacian spectra extends beyond theoretical chemistry, computer science, electrical networks, and complex networks.
Ali Raza +3 more
openalex +2 more sources
On the Signless Laplacian ABC-Spectral Properties of a Graph
MathematicsIn the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather +2 more
doaj +2 more sources
Domination number and (signless Laplacian) spectral radius of cactus graphs
The Electronic Journal of Linear AlgebraA cactus graph is a connected graph whose block is either an edge or a cycle. A vertex set $S\subseteq V(G)$ is said to be a dominating set of a graph $G$ if every vertex in $V(G)\setminus S$ is adjacent to a vertex in $S$.
Ye Cui, Yuanyuan Chen, Dan Li, Yue Zhang
openalex +3 more sources