Some graphs determined by their signless laplacian (Distance) spectra
, 2020 In literature, there are some results known about spectral determination of graphs with many edges. In [M.~C\'{a}mara and W.H.~Haemers. Spectral characterizations of almost complete graphs. {\em Discrete Appl.
Adiga, Chandrashekar +2 more
core +1 more source
Quantitative structure-properties relationship analysis of Eigen-value-based indices using COVID-19 drugs structure. [PDF]
Int J Quantum Chem, 2023 Rauf A, Naeem M, Hanif A.
europepmc +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation. [PDF]
Front Chem, 2023 Munir MM, Wusqa UT.
europepmc +1 more source
Some results on signless Laplacian coefficients of graphs [PDF]
, 2012 Let QG(x)=det(xI-Q(G))=∑i=0n(-1)iζixn-i be the characteristic polynomial of the signless Laplacian matrix of a graph G. Due to the nice properties of the signless Laplacian matrix, Q(G), in comparison with the other matrices related to graphs, ζ-ordering,
Mirzakhah, Maryam, Kiani, Dariush
core +1 more source
A decision-making technique under interval-valued Fermatean fuzzy Hamacher interactive aggregation operators. [PDF]
Soft comput, 2023 Shahzadi G, Luqman A, Karaaslan F.
europepmc +1 more source
Signless Laplacian Estrada index and Laplacian Estrada index of uniform hypergraphs
, 2022 We generalize the notions of Laplacian and signless Laplacian Estrada index to uniform hypergraphs. For an $r$-uniform hypergraph $H,$ we derive an order $r+1$ trace formula of the (signless) Laplacian tensor of $H.$ Among others by using this trace ...
Wang, Ligong +2 more
core
Multi-attribute decision-making for electronic waste recycling using interval-valued Fermatean fuzzy Hamacher aggregation operators. [PDF]
Granul Comput, 2023 Luqman A, Shahzadi G.
europepmc +1 more source
Bipartite subgraphs and the signless Laplacian matrix [PDF]
, 2011 For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalized Laplacian eigenvalue.
Debdas Paul, Steve Kirkland
core +1 more source
Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
, 2018 Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let ∂1≥⋯≥∂n $\partial_{1}\geq\cdots\geq\partial_{n}$, ∂1L≥⋯≥∂nL $\partial_{1}^{L}\geq\cdots\geq\partial_{n}^{L}$
Huicai Jia, Hongye Song
core +1 more source
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core