Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Harary index of Lehmer three mean graphs
View through CrossRef
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph G = (v, E). In this paper we investigate Harary Index of Lehmer three Mean graph for some graphs.
Universidad Tecnica de Manabi
Title: Harary index of Lehmer three mean graphs
Description:
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph G = (v, E).
In this paper we investigate Harary Index of Lehmer three Mean graph for some graphs.
Related Results
Harary spectra and Harary energy of line graphs of regular graphs
Harary spectra and Harary energy of line graphs of regular graphs
The Harary matrix of a graph G is defined as RD(G) = [rij] in which rij = 1 ∕ dij if i ≠ j and rij = 0 if i = j, where dij is the distance between the vertices vi and vj in G. The ...
Tightness of Harary Graphs
Tightness of Harary Graphs
In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tig...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
Let 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 qu...
k-Lehmer three mean labeling of some graphs
k-Lehmer three mean labeling of some graphs
A function $\mathrm{h}$ is called $\mathrm{k}$ - Lehmer-3 mean graph $\mathrm{G}$ with $\mathrm{r}$ vertices and $\mathrm{s}$ edges, if it is possible to label the vertices $v \in ...