Results 71 to 80 of about 42,138 (164)
Signless Laplacians of finite graphs [PDF]
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied when some operations, such as edge moving, edge subdividing, are applied to the graph.
Bolian Liu +11 more
core +1 more source
Construction of Albertson Cospectral and Albertson Equienergetic Graphs Using Graph Operations
The energy of a graph is an invariant calculated as the sum of the absolute eigenvalues of its adjacency matrix. This concept extends to various types of energies derived from different graph‐related matrices. This paper explores the spectral properties of Albertson energy and Albertson spectra.
Jane Shonon Cutinha +3 more
wiley +1 more source
Some graphs determined by their signless laplacian (Distance) spectra [PDF]
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 +3 more
core +1 more source
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source
On the sum of signless Laplacian spectra of graphs
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 +1 more source
Sufficient Conditions for Spanning k‐Hypertrees via Distance Spectral Radius of Hypergraphs
For an integer k ≥ 2, a spanning k‐hypertree T is defined as a spanning hypertree (β‐acyclic) such that the maximum degree dT(v) of every vertex v ∈ V(T) is at most k. A sufficient condition for the existence of a spanning k‐hypertree in connected hypergraphs is established.
Qiannan Niu +4 more
wiley +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
Unifying adjacency, Laplacian, and signless Laplacian theories
The final version of the article to be appear in Ars Mathematica ...
Aniruddha Samanta +2 more
openaire +4 more sources
A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph [PDF]
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non-bipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its
Peter Rowlinson +11 more
core +1 more source
This study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis. Motivated by the need to understand how helical topology influences network dynamics and robustness, we derive exact analytical expressions for three key ...
Fareeha Hanif +3 more
wiley +1 more source

