Results 61 to 70 of about 5,566,785 (118)

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, Duan, Cunxiang, van Dam, Edwin R.   +2 more
core  

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

The fan graph is determined by its signless Laplacian spectrum [PDF]

, 2020
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, Liu, Muhuo, Chandra Das, Kinkar   +2 more
core   +1 more source

Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs [PDF]

, 2019
‎In this paper‎, ‎we study the eigenvalues of the reciprocal distance signless Laplacian matrix of a connected graph and‎ ‎obtain some bounds for the maximum‎ ‎eigenvalue of this matrix‎.
Ramane, ‎Harishchandra, Baghipur, Maryam, Alhevaz, Abdollah   +2 more
core   +1 more source

On conjectures involving second largest signless Laplacian eigenvalue of graphs [PDF]

, 2010
Let G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the Laplacian matrix of G is L(G)=D(G)-A(G) and the signless Laplacian matrix of G is Q(G)=D(G)+A(G). In this paper we obtain a
Das, Kinkar Ch.
core   +1 more source

On spectrum and energies of enhanced power graphs

Mathematics Open
The enhanced power graph [Formula: see text] of a group G is a simple graph with vertex set G and two distinct vertex are adjacent if and only if they belong to the same cyclic subgroup.
Pankaj Kalita, Prohelika Das
doaj   +1 more source

Universal Adjacency Matrices with Two Eigenvalues [PDF]

AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core  

Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs [PDF]

, 2016
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spectral radius, signless Laplacian spectral radius) and the clique number together with the corresponding extremal graphs in the class of connected graphs ...
Das, Kinkar Ch., Liu, Muhuo
core   +1 more source

Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs

Mathematics, 2019
Suppose that G is a simple undirected connected graph. Denote by D ( G ) the distance matrix of G and by T r ( G ) the diagonal matrix of the vertex transmissions in G, and let α ∈ [ 0 , 1 ] .
Abdollah Alhevaz, Maryam Baghipur, Yilun Shang   +2 more
doaj   +1 more source

ENERGY OF NON-COPRIME GRAPH ON MODULO GROUP

Barekeng
A graph is a mathematical structure consisting of a non-empty set of vertices and a set of edges connecting these vertices. In recent years, extensive research on graphs has been conducted, with one of the intriguing topics being the representation of ...
Gusti Yogananda Karang, I Gede Adhitya Wisnu Wardhana, Manimaran Angamuthu   +2 more
doaj   +1 more source