Results 31 to 40 of about 68,836 (161)
Majorization bounds for signless Laplacian eigenvalues
The Electronic Journal of Linear Algebra, 2013 It is known that, for a simple graph G and a real number , the quantity s0 (G) is defined as the sum of the -th power of non-zero singless Laplacian eigenvalues of G. In this paper, first some majorization bounds over s 0(G) are presented in terms of the degree sequences, and number of vertices and edges of G. Additionally, a connection between s 0(G)
Maden, A. Dilek, Cevik, A. Sinan
openaire +2 more sources
Constructing non-isomorphic signless Laplacian cospectral graphs [PDF]
Discrete Mathematics, 2020 In this article, we generate large families of non-isomorphic and signless Lalacian cospectral graphs using partial transpose on graphs. Our constructions are significantly powerful. More than $70\%$ of non-isomorphic signless-Laplacian cospectral graphs can be generated with partial transpose when number of vertices is $\le 8$.
openaire +2 more sources
Bounds for the signless Laplacian energy
Linear Algebra and its Applications, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abreu, Nair +4 more
openaire +4 more sources
New bounds for the signless Laplacian spread [PDF]
Linear Algebra and its Applications, 2019 Let $G$ be a simple graph. The signless Laplacian spread of $G$ is defined as the maximum distance of pairs of its signless Laplacian eigenvalues. This paper establishes some new bounds, both lower and upper, for the signless Laplacian spread. Several of these bounds depend on invariant parameters of the graph.
Enide Andrade +3 more
openaire +6 more sources
Eigenvalue bounds for the signless laplacian
Publications de l'Institut Mathematique, 2007 We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bounds for eigenvalues are given, and the main result concerns the graphs whose largest eigenvalue is maximal among the graphs with fixed numbers of vertices and edges. The results are presented in the context of a number of computer-generated conjectures.
Cvetkovic, Dragos +2 more
openaire +2 more sources
Topological Indices of Certain Transformed Chemical Structures
Journal of Chemistry, Volume 2020, Issue 1, 2020., 2020 Topological indices like generalized Randić index, augmented Zagreb index, geometric arithmetic index, harmonic index, product connectivity index, general sum‐connectivity index, and atom‐bond connectivity index are employed to calculate the bioactivity of chemicals.
Xuewu Zuo +5 more
wiley +1 more source
Eigenvalue Bounds for the Signless $p$-Laplacian
The Electronic Journal of Combinatorics, 2018 We consider the signless $p$-Laplacian $Q_p$ of a graph, a generalisation of the quadratic form of the signless Laplacian matrix (the case $p=2$). In analogy to Rayleigh's principle the minimum and maximum of $Q_p$ on the $p$-norm unit sphere are called its smallest and largest eigenvalues, respectively.
Borba, Elizandro Max, Schwerdtfeger, Uwe
openaire +3 more sources
Graphs determined by signless Laplacian spectra [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Accepted in AKCE International Journal of Graphs and Combinatorics(To appear). arXiv preprint arXiv:1803.06135 has been accepted in Carpathian Mathematical Publications.
Ali Zeydi Abdian +2 more
openaire +3 more sources
A Note on Some Bounds of the α‐Estrada Index of Graphs
Advances in Mathematical Physics, Volume 2020, Issue 1, 2020., 2020 Let G be a simple graph with n vertices. Let A~αG=αDG+1−αAG, where 0 ≤ α ≤ 1 and A(G) and D(G) denote the adjacency matrix and degree matrix of G, respectively. EEαG=∑i=1neλi is called the α‐Estrada index of G, where λ1, ⋯, λn denote the eigenvalues of A~αG. In this paper, the upper and lower bounds for EEα(G) are given.
Yang Yang +3 more
wiley +1 more source
Construction for the Sequences of Q‐Borderenergetic Graphs
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 This research intends to construct a signless Laplacian spectrum of the complement of any k‐regular graph G with order n. Through application of the join of two arbitrary graphs, a new class of Q‐borderenergetic graphs is determined with proof. As indicated in the research, with a regular Q‐borderenergetic graph, sequences of regular Q‐borderenergetic ...
Bo Deng +4 more
wiley +1 more source