Results 1 to 10 of about 39 (39)
Five results on maximizing topological indices in graphs [PDF]
In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence number.
Stijn Cambie
doaj +1 more source
On inverse sum indeg energy of graphs
For a simple graph with vertex set {v1,v2,…,vn}\left\{{v}_{1},{v}_{2},\ldots ,{v}_{n}\right\} and degree sequence dvii=1,2,…,n{d}_{{v}_{i}}\hspace{0.33em}i=1,2,\ldots ,n, the inverse sum indeg matrix (ISI matrix) AISI(G)=(aij){A}_{{\rm{ISI}}}\left(G ...
Jamal Fareeha +2 more
doaj +1 more source
Energy of a digraph with respect to a VDB topological index
Let DD be a digraph with vertex set VV and arc set EE. For a vertex uu, the out-degree and in-degree of uu are denoted by du+{d}_{u}^{+} and du−{d}_{u}^{-}, respectively.
Monsalve Juan, Rada Juan
doaj +1 more source
Mostar index of graphs associated to groups
A bond-additive connectivity index, named as the Mostar index, is used to measure the amount of peripheral edges of a simple connected graph, where a peripheral edge in a graph is an edge whose one end vertex has more number of vertices closer as ...
Rehman Masood Ur +4 more
doaj +1 more source
Computing the Hosoya Polynomial of M‐th Level Wheel and Its Subdivision Graph
The determination of Hosoya polynomial is the latest scheme, and it provides an excellent and superior role in finding the Weiner and hyper‐Wiener index. The application of Weiner index ranges from the introduction of the concept of information theoretic analogues of topological indices to the use as major tool in crystal and polymer studies.
Peng Xu +6 more
wiley +1 more source
Some topological indices of dendrimers determined by their Banhatti polynomials
Several properties of chemical compounds in a molecular structure can be determined with the aid of mathematical languages provided by various types of topological indices.
Chu Zheng-Qing +6 more
doaj +1 more source
Wiener index and addressing of some finite graphs
An addressing of length t of a graph G is an assignment of t-tuples with entries in [Formula: see text] called addresses, to the vertices of G such that the distance between any two vertices can be determined from their addresses.
Mona Gholamnia Taleshani, Ahmad Abbasi
doaj +1 more source
In the study of chemical graph theory, an enormous number of research analyses have confirmed that the characteristics of chemicals have a nearby connection with their atomic structure.
Chen Shu-Bo +4 more
doaj +1 more source
General Randić indices of a graph and its line graph
For a real number α\alpha , the general Randić index of a graph GG, denoted by Rα(G){R}_{\alpha }\left(G), is defined as the sum of (d(u)d(v))α{\left(d\left(u)d\left(v))}^{\alpha } for all edges uvuv of GG, where d(u)d\left(u) denotes the degree of a ...
Liang Yan, Wu Baoyindureng
doaj +1 more source
Sombor index of zero-divisor graphs of commutative rings
In this paper, we investigate the Sombor index of the zero-divisor graph of ℤn which is denoted by Γ(ℤn) for n ∈ {pα, pq, p2q, pqr} where p, q and r are distinct prime numbers. Moreover, we introduce an algorithm which calculates the Sombor index of Γ(ℤn)
Gürsoy Arif +2 more
doaj +1 more source

