Results 21 to 30 of about 39 (39)

On the Harary Estrada index of graphs

Special Matrices
Let GG be a connected graph with nn vertices v1,…,vn{v}_{1},\ldots ,{v}_{n}. The Harary matrix of GG, denoted by H(G)H\left(G), is an n×nn\times n matrix with a zero main diagonal, where the (i,j)\left(i,j)-entry is 1d(vi,vj)\frac{1}{d\left({v}_{i},{v}_ ...
Oboudi Mohammad Reza
doaj   +1 more source

Study on (r, s)-generalised transformation graphs, a novel perspective based on transformation graphs

Main Group Metal Chemistry
For a graph Q=(V,E){\mathbb{Q}}=\left({\mathbb{V}},{\mathbb{E}}), the transformation graph are defined as graphs with vertex set being V(Q)∪E(Q){\mathbb{V}}\left({\mathbb{Q}})\cup {\mathbb{E}}\left({\mathbb{Q}}) and edge set is described following ...
Ali Parvez, Baby Annmaria, Xavier D. Antony, Theertha Nair A., Ali Haidar, Kirmani Syed Ajaz K.   +5 more
doaj   +1 more source

Indeks Padmakar-Ivan dan indeks Randic pada graf non-koprima dari grup bilangan bulat modulo

Majalah Ilmiah Matematika dan Statistika
Graph theory, introduced by the Swiss mathematician Leonhard Euler in 1736, has played a pivotal role in solving real-world problems since its inception, notably exemplified by Euler's solution to the Konigsberg Bridge problem. Its applications extend to
Lalu Hasan Ghoffari, I Gede Adhitya Wisnu Wardhana, Abdurahim Abdurahim   +2 more
doaj   +1 more source

The minimum exponential atom-bond connectivity energy of trees

Special Matrices
Let G=(V(G),E(G))G=\left(V\left(G),E\left(G)) be a graph of order nn. The exponential atom-bond connectivity matrix AeABC(G){A}_{{e}^{{\rm{ABC}}}}\left(G) of GG is an n×nn\times n matrix whose (i,j)\left(i,j)-entry is equal to ed(vi)+d(vj)−2d(vi)d(vj){e}^
Gao Wei
doaj   +1 more source

A new method for computing the vertex PI index with applications to special classes of graphs

AKCE International Journal of Graphs and Combinatorics
The Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju, K. Somasundaram, Yilun Shang   +2 more
doaj   +1 more source

On the vv-degree based first Zagreb index of graphs

AKCE International Journal of Graphs and Combinatorics
A topological index is a graph invariant applicable in chemistry. The first Zagreb index is a topological index based on the vertex degrees of molecular graphs. For any graph G, the first Zagreb index [Formula: see text] is equal to the sum of squares of
L. Anusha, N. V. Sayinath Udupa, N. Prathviraj   +2 more
doaj   +1 more source

On the maximum atom-bond sum-connectivity index of graphs

Open Mathematics
The atom-bond sum-connectivity (ABS) index of a graph GG with edges e1,…,em{e}_{1},\ldots ,{e}_{m} is the sum of the numbers 1−2(dei+2)−1\sqrt{1-2{\left({d}_{{e}_{i}}+2)}^{-1}} over 1≤i≤m1\le i\le m, where dei{d}_{{e}_{i}} is the number of edges adjacent
Alraqad Tariq, Saber Hicham, Ali Akbar, Albalahi Abeer M.   +3 more
doaj   +1 more source

New bounds on Zagreb connection indices for trees with fixed domination number

AKCE International Journal of Graphs and Combinatorics
A set D of vertices in a graph G is a dominating set of G if every vertex not in D is adjacent to a vertex in D. The domination number, [Formula: see text], is the minimum cardinality among all dominating sets of G.
H. Rahbani, H. Abdollahzadeh Ahangar, Michael A. Henning   +2 more
doaj   +1 more source

Wiener index of an ideal-based zero-divisor graph of commutative ring with unity

AKCE International Journal of Graphs and Combinatorics
The Wiener index of a connected graph G is [Formula: see text]. In this paper, we obtain the Wiener index of H-generalized join of graphs [Formula: see text]. As a consequence, we obtain some earlier known results in [Alaeiyan et al. in Aust. J.
Balamoorthy S., Kavaskar T., Vinothkumar K   +2 more
doaj   +1 more source

Further development of F-index for fuzzy graph and its application in Indian railway crime. [PDF]

J Appl Math Comput, 2023
Islam SR, Pal M.
europepmc   +1 more source