Results 71 to 80 of about 1,271 (139)
Spectra of general hypergraphs
, 2017 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
Journal of Inequalities and Applications, 2020 In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj +1 more source
On the Aα-Spectral Radii of Cactus Graphs
Mathematics, 2020 Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang +3 more
doaj +1 more source
Graphs with the second signless Laplacian eigenvalue ≤ 4
Special Matrices, 2021 We discuss the question of classifying the connected simple graphs H for which the second largest eigenvalue of the signless Laplacian Q(H) is ≤ 4. We discover that the question is inextricable linked to a knapsack problem with infinitely many allowed ...
Drury Stephen
doaj +1 more source
On the eigenvalues of the distance signless Laplacian matrix of graphs
Proyecciones (Antofagasta)Let G be a connected graph and let DQ(G) be the distance signless Laplacian matrix of G with eigenvalues ρ1≥ ρ2≥…≥ ρn. The spread of the matrix DQ}(G) is defined as s(DQ(G)) := maxi,j| ρi-ρj| = ρ1- ρn. We derive new bounds for the distance signless Laplacian spectral radius ρ1 of G.
Akbar Jahanbani +3 more
openaire +1 more source
Ain Shams Engineering JournalIn this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj +1 more source
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
MathematicsLet X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new
Luis Medina +2 more
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 ...
Haemers, W.H., Omidi, G.R.
core +1 more source
The second least eigenvalue of the signless Laplacian of the complements of trees
Electronic Journal of Graph Theory and Applications, 2019 Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In 2012, Li and Wang gave the unique graph in the set Tnc ∖ {K1, n − 1c} with minimum 1st ‘least eigenvalue of the signless Laplacian’ (abbreviated to a ...
Muhammad Ajmal +2 more
doaj +1 more source
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, 2018 Let G be a simple graph. In this paper, we disprove two conjectures proposed by P. Hansen and C. Lucas in the paper Bounds and conjectures for the signless Laplacian index of graphs. We find an infinite class of graphs as a counterexample for two conjectures relating the spectral radius of the signless Laplacian and the independence number of G.
Jorge Alencar, Leonardo Lima
openaire +2 more sources