Results 51 to 60 of about 858 (123)
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
Merging the A- and Q-spectral theories
Let $G$ be a graph with adjacency matrix $A\left( G\right) $, and let $D\left( G\right) $ be the diagonal matrix of the degrees of $G.$ The signless Laplacian $Q\left( G\right) $ of $G$ is defined as $Q\left( G\right) :=A\left( G\right) +D\left( G\right)
Nikiforov, V.
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
Spectra of general hypergraphs
Here, we show a method to reconstruct connectivity hypermatrices of a general hypergraph (without any self loop or multiple edge) using tensor. We also study the different spectral properties of these hypermatrices and find that these properties are ...
Banerjee, Anirban +2 more
core +1 more source
Molecular structures. Abstract Malaria has a wide impact on the healthcare system, affecting everyone from hyperendemic areas who dearth access to medical treatment to international tourists returning to nonendemic regions with tertiary referral care. Implementing timely and accurate diagnosis is necessary to stop malaria's growing global effect, which
Nadeem ul Hassan Awan +5 more
wiley +1 more source
New constructions of nonregular cospectral graphs
We consider two types of joins of graphs G1{G}_{1} and G2{G}_{2}, G1⊻G2{G}_{1}\hspace{0.33em}⊻\hspace{0.33em}{G}_{2} – the neighbors splitting join and G1∨=G2{G}_{1}\mathop{\vee }\limits_{=}{G}_{2} – the nonneighbors splitting join, and compute ...
Hamud Suleiman, Berman Abraham
doaj +1 more source
On some aspects of the generalized Petersen graph
Let $p \ge 3$ be a positive integer and let $k \in {1, 2, ..., p-1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as $V(GP(p, k)) = \{u_i : i \in Zp\} \cup \{u_i^\prime : i \in Z_p\}$ and $E(GP(p, k)) = \{u_i ...
V. Yegnanarayanan
doaj +1 more source
Abstract Landscape functions are a popular tool used to provide upper bounds for eigenvectors of Schrödinger operators on domains. We review some known results obtained in the last 10 years, unify several approaches used to achieve such bounds, and extend their scope to a large class of linear and nonlinear operators. We also use landscape functions to
Delio Mugnolo
wiley +1 more source
The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph [PDF]
In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given.
Hu, Shenglong, Qi, Liqun, Xie, Jinshan
core
On the Laplacian and signless Laplacian spectrum of a graph with
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abreu, Nair M. M. +4 more
openaire +5 more sources

