Results 21 to 30 of about 81 (63)

Resistance Distance and Kirchhoff Index for a Class of Graphs

open access: yesMathematical Problems in Engineering, Volume 2018, Issue 1, 2018., 2018
Let G[F, Vk, Hv] be the graph with k pockets, where F is a simple graph of order n ≥ 1, Vk = {v1, v2, …, vk} is a subset of the vertex set of F, Hv is a simple graph of order m ≥ 2, and v is a specified vertex of Hv. Also let G[F, Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek = {e1, e2, …ek} is a subset of the ...
WanJun Yin   +3 more
wiley   +1 more source

Generalized Characteristic Polynomials of Join Graphs and Their Applications

open access: yesDiscrete Dynamics in Nature and Society, Volume 2017, Issue 1, 2017., 2017
The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices of G in electrical networks. LEL(G) is the Laplacian‐Energy‐Like Invariant of G in chemistry. In this paper, we define two classes of join graphs: the subdivision‐vertex‐vertex join G1⊚G2 and the subdivision‐edge‐edge join G1⊝G2.
Pengli Lu   +3 more
wiley   +1 more source

Distance matrices on the H-join of graphs: A general result and applications [PDF]

open access: yes, 2018
Given a graph $H$ with vertices $1,\ldots ,s$ and a set of pairwise vertex disjoint graphs $G_{1},\ldots ,G_{s},$ the vertex $i$ of $H$ is assigned to $G_{i}.$ Let $G$ be the graph obtained from the graphs $G_{1},\ldots ,G_{s}$ and the edges connecting ...
Rojo, Oscar   +2 more
core   +1 more source

On the sum of powers of Laplacian eigenvalues of bipartite graphs [PDF]

open access: yes, 2010
summary:For a bipartite graph $G$ and a non-zero real $\alpha $, we give bounds for the sum of the $\alpha $th powers of the Laplacian eigenvalues of $G$ using the sum of the squares of degrees, from which lower and upper bounds for the incidence ...
Ilić, Aleksandar, Zhou, Bo
core   +1 more source

Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints

open access: yesJournal of Mathematics
For a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj   +1 more source

Investigating Signless Laplacian Spectra and Network Topology in Helical Phenylene‐Quadrilateral Structures

open access: yesJournal of Mathematics, Volume 2025, Issue 1, 2025.
This study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis. Motivated by the need to understand how helical topology influences network dynamics and robustness, we derive exact analytical expressions for three key ...
Fareeha Hanif   +3 more
wiley   +1 more source

Further results on the distance signless Laplacian spectrum of graphs

open access: yes, 2018
The distance signless Laplacian matrix [Formula: see text] of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix
Abdollah Alhevaz   +2 more
core   +1 more source

Extremal properties of distance-based graph invariants for $k$-trees [PDF]

open access: yes, 2017
summary:Sharp bounds on some distance-based graph invariants of $n$-vertex $k$-trees are established in a unified approach, which may be viewed as the weighted Wiener index or weighted Harary index.
Zhang, Minjie   +3 more
core   +1 more source

QSPR analysis for physiochemical properties of new potential antimalarial compounds involving topological indices

open access: yesInternational Journal of Quantum Chemistry, Volume 124, Issue 11, June 5, 2024.
Molecular structures. Abstract Malaria has a wide impact on the healthcare system, affecting everyone from hyperendemic areas who dearth access to medical treatment to international tourists returning to nonendemic regions with tertiary referral care. Implementing timely and accurate diagnosis is necessary to stop malaria's growing global effect, which
Nadeem ul Hassan Awan   +5 more
wiley   +1 more source

Distance Spectra of Some Double Join Operations of Graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2024, Issue 1, 2024.
In literature, several types of join operations of two graphs based on subdivision graph, Q‐graph, R‐graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation based on (H1, H2)‐merged subdivision graph.
B. J. Manjunatha   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy