On Topological Indices of mth Chain Hex-Derived Network of Third Type
In theoretical chemistry, the numerical parameters that are used to characterize the molecular topology of graphs are called topological indices. Several physical and chemical properties like boiling point, entropy, heat formation, and vaporization ...
Yuhong Huo +5 more
doaj +1 more source
The Smallest Harmonic Index of Trees with Given Maximum Degree
The harmonic index of a graph G, denoted by H(G), is defined as the sum of weights 2/[d(u) + d(v)] over all edges uv of G, where d(u) denotes the degree of a vertex u. In this paper we establish a lower bound on the harmonic index of a tree T.
Rasi Reza, Sheikholeslami Seyed Mahmoud
doaj +1 more source
The general position problem and strong resolving graphs
The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj +1 more source
Computational analysis for eccentric neighborhood Zagreb indices and their significance. [PDF]
Ahmed H +4 more
europepmc +1 more source
Strong edge geodetic problem in networks
Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95].
Manuel Paul +4 more
doaj +1 more source
Symmetries and symmetry-breaking in arithmetic graphs. [PDF]
Shah A, Javaid I, Rehman SU.
europepmc +1 more source
Coloring the vertices of a graph with mutual-visibility property
Given a graph GG, a mutual-visibility coloring of GG is a coloring of the vertices of GG satisfying the following. Two vertices x,y∈V(G)x,y\in V\left(G) can be colored with the same color, if there is a shortest x,yx,y-path whose internal vertices have ...
Klavžar Sandi +3 more
doaj +1 more source
Comparative Study of Planar Octahedron Molecular Structure via Eccentric Invariants. [PDF]
Chu ZQ +5 more
europepmc +1 more source
Biochemical phenotyping of paroxysmal nocturnal hemoglobinuria reveals solute carriers and β-oxidation deficiencies. [PDF]
Yamakawa PE +7 more
europepmc +1 more source
On the spectral radius and energy of the degree distance matrix of a connected graph
Let GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj +1 more source

