The fan graph is determined by its signless Laplacian spectrum [PDF]
summary:Given a graph $G$, if there is no nonisomorphic graph $H$ such that $G$ and $H$ have the same signless Laplacian spectra, then we say that $G$ is \hbox {$Q$-DS}.
Yuan, Yuan +2 more
core +1 more source
Signless Laplacian energy of interval-valued fuzzy graph and its applications [PDF]
An interval-valued fuzzy graph (IVFG) emanates from a fuzzy graph (FG) where the membership is given in interval form. This framework give the user more flexibility in dealing with fuzzy information.
Al-Quran, Ashraf +4 more
core +1 more source
Inequalities for Distance Signless Laplacian Matrix Under Minimum‐Degree Constraints
For a connected graph G of order n, let D(G) denote its distance matrix and let Tr(G) be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ = D(G) + Tr(G). The largest eigenvalue of DQ, written as ∂1QG, is referred to as the distance signless Laplacian spectral radius of G.
Mohd Abrar Ul Haq +3 more
wiley +1 more source
LAPLACIAN SPECTRUM AND ENERGY OF NON-COMMUTING GRAPHS OF FINITE RINGS [PDF]
We compute spectrum, energy, Laplacian spectrum/ energy and signless Laplacian spectrum/energy of non-commuting graphs of certain finite non-commutative rings. In particular, we consider finite rings $R$ such that $|R| = p^2, p^3, p^4$, $p^5$, $p^2q$ and
Monalisha Sharma, Rajat Nath
doaj +1 more source
Refined Lower Bounds for the Laplacian Estrada Index of Connected Graphs via the Two Largest Degrees
Let G be a graph with n vertices and Laplacian eigenvalues μ1, μ2, …, μn. The Laplacian Estrada index of G is defined as LEEG=eμ1+⋯+eμn. In this paper, using the Karush–Kuhn–Tucker optimization framework under inequality constraints, we establish new lower bounds for LEE(G) in terms of the two largest degrees of G.
Hamidreza Bamdad +3 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
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
SPEKTRUM GRAF KORONA SISI PANGKAT DUA PADA MATRIKS KETETANGGAAN, LAPLACIAN, DAN SIGNLESS LAPLACIAN [PDF]
Diberikan dua graf terhubung G dan H. Ordo dan ukuran dari G dan H bertutut-turut adalah u dan v, dan m dan n. Graf G korona sisi pangkat dua H, dinotasikan dengan G⋄^2 H dan didefinisikan sebagai G⋄^2 H∶=(G⋄H)⋄H, adalah suatu graf yang didapatkan dari ...
Zulkarnain, Syaiful Ridzal
core
Spectrum of the Cozero-Divisor Graph Associated to Ring
Let R be a commutative ring with identity 1≠0 and let Z(R)′ be the set of all non-unit and non-zero elements of ring R. Γ′(R) denotes the cozero-divisor graph of R and is an undirected graph with vertex set Z(R)′, w∉zR, and z∉wR if and only if two ...
Mohd Rashid +3 more
doaj +1 more source
On the reduced signless Laplacian spectrum of a degree maximal graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tam, Bit-Shun, Wu, Shu-Hui
openaire +1 more source

