Results 41 to 50 of about 42,138 (164)
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
Complexity, Volume 2021, Issue 1, 2021., 2021 A connected graph is called Hamilton‐connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton‐connected is an NP‐complete problem. Hamiltonian and Hamilton‐connected graphs have diverse applications in computer science and electrical engineering.
Sakander Hayat +4 more
wiley +1 more source
Signless Laplacian energy, distance Laplacian energy and distance signless Laplacian spectrum of unitary addition Cayley graphs [PDF]
Linear and Multilinear Algebra, 2021 In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}.
P., Naveen, A. V, Chithra
openaire +2 more sources
Some Chemistry Indices of Clique‐Inserted Graph of a Strongly Regular Graph
Complexity, Volume 2021, Issue 1, 2021., 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique‐inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique‐inserted graph of strongly regular graph are calculated. We also give formulae expressing the energy, Kirchoff index, and the number of spanning trees of clique‐inserted ...
Chun-Li Kan +4 more
wiley +1 more source
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue [PDF]
, 2021 The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Ghorbani, Modjtaba +7 more
core +1 more source
A novel method to construct cospectral graphs based on RT operation [PDF]
AIP AdvancesThis paper presents a new graph operation, RT(G), which is formed by transforming each vertex and edge of the original graph G into a triangle. We analyze the relationship between the signless Laplacian characteristic polynomials of the graph RT(G) and ...
Xiu-Jian Wang +2 more
doaj +1 more source
Bounds for the signless Laplacian energy
Linear Algebra and its Applications, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
De Abreu N. +4 more
openaire +5 more sources
Maxima of the signless Laplacian spectral radius for planar graphs [PDF]
, 2015 The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq
Yu, Guanglong +2 more
core +1 more source
Maximality of the signless Laplacian energy
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lucélia Kowalski Pinheiro +1 more
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 +4 more sources
Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs [PDF]
, 2002 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. +3 more
core +1 more source