Results 111 to 120 of about 110,880 (163)

The clique and coclique numbers' bounds based on the H-eigenvalues of uniform hypergraphs

, 2020
In this paper, some inequality relations between the Laplacian/signless Laplacian H-eigenvalues and the clique/coclique numbers of uniform hypergraphs are presented. For a connected uniform hypergraph, some tight lower bounds on the largest Laplacian H +
Jinshan Xie, Liqun Qi
core  

The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph

, 2013
22 pages, 3 ...
Hu, Shenglong, Qi, Liqun
openaire   +2 more sources

The Bounds for Eigenvalues of Normalized and Signless Laplacian Matrices

, 2014
5 ...
Büyükköse, Şerife, Eski, Şehri Gülčiček   +1 more
openaire   +2 more sources

Closeness Laplacian and closeness signless Laplacian energies of non-commuting graph for dihedral groups

This research investigates the relationship between algebra and graph theory, specifically how algebra facilitates graph theory. Associating matrices with graphs introduces the concept of graph energies.
Abdurahim, Abdurahim, Hakim Maharani, Andika Ellena Saufika, Nawawi, Athirah, Dani, Ifan Hasnan, Romdhini, Mamika Ujianita, Al-Sharqi, Faisal   +5 more
core   +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, Duan, Cunxiang, van Dam, Edwin R.   +2 more
core  

On graphs with exactly three Q-eigenvalues at least two

, 2013
For a graph G, we here investigate its signless Laplacian matrix Q(G) and the corresponding Q-eigenvalues. By considering the relation between the Q-spectrum and the circumference of G, we characterize all connected graphs with exactly three Q ...
Wang, Wei, BELARDO, Francesco, Huang, Qiongxiang, Wang, Jianfeng, WANG W., HUANG Q. X., WANG J. F.   +6 more
core   +1 more source

Dissecting molecular network structures using a network subgraph approach. [PDF]

PeerJ, 2020
Huang CH, Zaenudin E, Tsai JJP, Kurubanjerdjit N, Dessie EY, Ng KL.   +5 more
europepmc   +1 more source

Bounds for the signless laplacian energy

The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of ...
Gutman, I., Robbiano, M., Cardoso, Domingos M., Abreu, N., Martins, E. A.   +4 more
core  

Unifying adjacency, Laplacian, and signless Laplacian theories [PDF]

Let G be a simple graph with associated diagonal matrix of vertex degrees D(G), adjacency matrix A(G), Laplacian matrix L(G) and signless Laplacian matrix Q(G).
Samanta, Aniruddha, Das, Kinkar Chandra, Deepshikha,   +2 more
core   +1 more source

Nordhaus-Gaddum Type Bounds For Laplacian And Signless Laplacian Eigenvalues Of Graphs

, 2018
Grafların Laplasyan, İşaretsiz Laplasyan matrisi ve öz değerleri matematikte ve birçok alanda büyük ölçüde kullanılmaktadır. Bir grafın ve bu grafın komplementinin graf değişmezlerinin toplamı ya da çarpımının herhangi bir alt veya üst sınırı Nordhaus ...
BAŞBUĞ, Aysun, SORGUN, Sezer
core