Results 71 to 80 of about 1,309,008 (158)

On the signless Laplacian spectrum of k -uniform hypergraphs

open access: yesLinear and Multilinear Algebra
Let $\mathcal{H}$ be a connected $k$-uniform hypergraph on $n$ vertices and $m$ hyperedges. In [A.~Banerjee, On the spectrum of hypergraph, Linear Algebra and its Application, 614(2021), 82--110], Anirban Banerjee introduced a new adjacency matrix for hypergraphs.
Bapat, R. B., Saha, S. S., Panda, S. K.
openaire   +2 more sources

Determining some graph joins by the signless Laplacian spectrum

open access: yesDiscrete Applied Mathematics
A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the complete bipartite graph with $l$ vertices, respectively.
Jiachang Ye, Jianguo Qian, Zoran Stanic
openaire   +2 more sources

The smallest eigenvalue of the signless Laplacian

open access: yes, 2011
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are many results about the largest eigenvalue of the signless Laplacian, the properties of its smallest eigenvalue are less well studied.
Nikiforov, Vladimir   +7 more
core   +1 more source

Some graphs determined by their signless laplacian (Distance) spectra [PDF]

open access: yes, 2020
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

Adjacency spectra and Laplacian integrality of zero divisor graphs over some rings

open access: yesKuwait Journal of Science
Let 𝑅 be a commutative ring and let π‘βˆ— (𝑅) denote the set of non-zero zero divisors of 𝑅. The zero divisor graph 𝛀(𝑅) is defined as the simple graph with vertex set π‘βˆ— (𝑅), where two distinct vertices π‘₯, 𝑦 ∈ π‘βˆ— (𝑅) are adjacent if and only if π‘₯𝑦 = 0.
Bilal Ahmad Rather   +3 more
doaj   +1 more source

Common neighborhood (signless) Laplacian spectrum and energy of CCC-graph

open access: yesBoletim da Sociedade Paranaense de MatemΓ‘tica
In this paper, we consider commuting conjugacy class graph (abbreviated as CCC-graph) of a finite group $G$ which is a graph with vertex set $\{x^G : x \in G \setminus Z(G)\}$ (where $x^G$ denotes the conjugacy class containing $x$) and two distinct vertices $x^G$ and $y^G$ are joined by an edge if there exist some elements $x'\in x^G$ and $y'\in y^G ...
Jannat, Firdous Ee, Nath, Rajat Kanti
openaire   +2 more sources

Universal Adjacency Matrices with Two Eigenvalues [PDF]

open access: yes
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  

Signless Laplacian spectral characterization of graphs with isolated vertices

open access: yes, 2016
A graph is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a DQS graph G, we show that G ? rK1 is DQS under certain conditions.
Jiang Zhou, Shaobin Huang, Changjiang Bu
core   +1 more source

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

open access: yes
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   +5 more
core   +1 more source

Signless Laplacian Estrada index and Laplacian Estrada index of uniform hypergraphs

open access: yes, 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   +2 more
core  

Home - About - Disclaimer - Privacy