Next Article in Journal
Multi-Shell Models of Celestial Bodies with an Intermediate Layer of Fluid: Dynamics in the Case of the Large Values of the Ekman Number
Previous Article in Journal
Constructions of Goethals–Seidel Sequences by Using k-Partition
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Topological Indices of Graphs from Vector Spaces

by
Krishnamoorthy Mageshwaran
1,
Nazeek Alessa
2,*,
Singaravelu Gopinath
3 and
Karuppusamy Loganathan
4,*
1
Department of Mathematics, Rajalakshmi Engineering College, Chennai 602105, Tamil Nadu, India
2
Department of Mathematical Sciences, College of Sciences, Princess Nourah Bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
3
Department of Mathematics, Sri Sairam Institute of Technology, Chennai 60004, Tamil Nadu, India
4
Department of Mathematics and Statistics, Manipal University Jaipur, Jaipur 303007, Rajasthan, India
*
Authors to whom correspondence should be addressed.
Mathematics 2023, 11(2), 295; https://doi.org/10.3390/math11020295
Submission received: 24 November 2022 / Revised: 27 December 2022 / Accepted: 31 December 2022 / Published: 6 January 2023

Abstract

:
Topological indices are numbers that are applied to a graph and can be used to describe specific graph properties through algebraic structures. Algebraic graph theory is a helpful tool in a range of chemistry domains. Because it helps explain how the different symmetries of molecules and crystals affect their structure and dynamics, it is a powerful theoretical approach for forecasting both the common and uncommon characteristics of molecules. A topological index converts the chemical structure into a number and contributes a lot in chemical graph theory. In this article, we compute the Wiener index, Zagreb indexes, Wiener polynomial, Hyper-Wiener index, ABC index and eccentricity-based topological index of a nonzero component union graph from vector space.
MSC:
05C10; 05C25; 05C75; 05C78

1. Introduction

In this paper, = ( V , E ) is a simple and connected graph with a vertex set V and an edge set E. The order and size of is established as the amount of elements in V and the number of elements in E correspondingly. If every different pair of vertices is adjacent in , then the graph is complete, and it is described by K n . The count of the edges from E that are incident with the vertex V is the degree of , and it is represented by d ( ) . The maximum (minimum) degree of is defined as Δ = m a x { d ( ) } ( δ = m i n { d ( ) } ) for all V . The distance between and in V is the distance of the shortest path between them; it is indicated by d ( , ) . The eccentricity ( e c c ( ) ) of is the largest distance between a vertex and each of the vertices of . The total length from any vertex of is calculated as D ( ) = V ( ) d ( , ) . The maximum distance among all the vertices in is the diameter of , symbolized by d i a m ( ) . The amount of unordered vertex pairs in that are accurately t distances apart is specified as d ( , t ) . We consult [1] for any graph theory keywords that are undefined.
A number, polynomial or matrix can be produced corresponding to a given graph in several ways. A topological graph index is an integer associated with a graph that fully uses the graph’s topology and it is invariant under graph isomorphism. In the present years, plenty of attention has been given to studies about the special properties of a topological index; one can refer to [2,3,4,5,6,7,8,9,10,11,12].
Das [13,14,15] introduced the new graphs on vector spaces. From the above initialization, some more authors studied this in [14,16]. In particular, Das recently defined and investigated two vector space graphs, namely the nonzero component and the nonzero component union graphs [13,14].
Some authors studied the basic graph theoretical properties of nonzero component union graphs. Further, [16,17] proved the results related to the embedding of the graph defined in [13,14].
Across this article, Λ is a φ dimension vector space ( d i m ( Λ ) = φ ) over the field F of order 𝒷 ( O ( F ) = 𝒷 ). Let B = { ϑ 1 , ϑ 2 , , ϑ φ } as a basis of Λ . Any vector Λ is represented as = a 1 ϑ 1 + a 2 ϑ 2 + + a φ ϑ φ , where a i F (simply denoted = ( a 1 , a 2 , , a φ ) ). The skeleton of any vector in Λ * = Λ { 0 } based on B is described by S B ( ) = { ϑ i : a i 0 , 1 i φ } . Moreover, a vector with skeleton ȷ means | S B ( ) | = ȷ . The nonzero component union graph of Λ based on the basis B is defined as a simple graph with V = Λ * and different nonzero vectors and in V are adjacent if and only if S B ( ) S B ( ) = B . This graph is denoted by Γ ( Λ B ) .
The graphs associated to algebra are also a significant contributor in several disciplines, including chemistry, engineering, medicine and business.

2. Fundamentals

The following definitions and theorems were used to determine the topological indices for the graphs under discussion. We put up a few current findings that will be discussed in this section.
Theorem 1 ([13]).
d i a m ( Γ ( Λ B ) ) = 2 and Γ ( Λ B ) are connected.
Theorem 2 ([13]).
Let O ( F ) = 𝒷 and d i m ( Λ ) = φ . Then, Γ ( Λ B ) is complete if and only if Λ has either ( φ = 1 ) or ( φ = 2 and 𝒷 = 2 ) .
Theorem 3 ([13]).
Let Γ ( Λ B ) be weakly perfect because its chromatic and clique number are equal to φ + ( 𝒷 1 ) φ .
Theorem 4 ([13]).
Let Γ ( Λ B ) be the nonzero component union graph of Λ based on B = { ϑ 1 , ϑ 2 , , ϑ φ } . Let = c 1 ϑ i 1 + c 2 ϑ i 2 + + c ȷ ϑ i ȷ be a vertex in Γ ( Λ B ) with c i 0 where 1 i ȷ . Then, deg ( ) = ( 𝒷 1 ) φ ȷ 𝒷 ȷ if 1 ȷ < φ ; 𝒷 φ 2 if ȷ = φ .
Theorem 5 ([13]).
Let O ( F ) = 𝒷 and d i m ( Λ ) = φ . Then, order and size of Γ ( Λ B ) is 𝒷 φ 1 and ( 𝒷 1 ) φ [ ( 𝒷 + 1 ) φ 3 ] 2 , respectively.
Theorem 6 ([13]).
If the minimum and maximum degree of Γ ( Λ B ) is δ = 𝒷 ( 𝒷 1 ) φ 1 and Δ = 𝒷 φ 2 .
Theorem 7 ([13]).
I = { ϑ Γ ( Λ B ) : S ( ϑ B ) { ϑ 1 , ϑ 2 , , ϑ φ 1 } } Γ ( Λ B ) be a maximal independent set. Moreover, if O ( F ) = 𝒷 , | I | = 𝒷 φ 1 1 .
Let us finish this section by listing some topological indexes of any graph that are also going to be considered in the current manuscript. One can refer to [2,9,10,11,12,18]
  • The Wiener index
    W ( ) = 1 2 , V ( ) d ( , ) .
  • The first Zagreb index
    M 1 ( ) = V ( ) d ( ) 2 .
  • The second Zagreb index
    M 2 ( ) = E ( ) d ( ) d ( ) .
  • The Wiener polynomial
    W ( ; x ) = , V ( ) x d ( , ) = ȷ = 1 d i a m ( ) d ( , ȷ ) x ȷ .
    The amount of unordered vertex pairs in that are accurately ȷ distances apart is specified as d ( , ȷ ) .
  • The Hyper-Wiener index
    W W ( ) = 1 2 W ( ) + 1 2 { , } V ( ) d ( , ) 2 = 1 2 ȷ = 1 d i a m ( ) ȷ ( ȷ + 1 ) d ( , ȷ ) .
  • The eccentricity index
    ξ ( ) = V ( ) d ( ) e c c ( ) .
  • The total eccentricity index
    ζ ( ) = V ( ) e c c ( ) .
  • The new version (eccentricity based) of Zagreb index
    M 1 * ( ) = E ( ) ( e c c ( ) + e c c ( ) ) .
    M 1 * * ( ) = V ( ) ( e c c ( ) ) 2
    M 2 * ( ) = E ( ) e c c ( ) e c c ( ) .
  • Average eccentricity index
    a v e g ( ) = 1 n V ( ) e c c ( ) .
    Here, n is total count of vertices in .
  • Eccentric distance sum index
    ξ D S ( ) = V ( ) e c c ( ) D ( | ) .
    where D ( | ) = V ( ) d ( , ) .
  • The ABC index
    A B C ( Γ ( Λ B ) ) = E ( ) d ( ) + d ( ) 2 d ( ) d ( ) .

3. Properties of Nonzero Component Union Graph of Vector Space

Let Λ be a vector space with O ( F ) = 𝒷 and d i m ( Λ ) = φ 1 . By Theorem 2, Γ ( Λ B ) is complete if and only if φ = 1 or ( φ = 2 and 𝒷 = 2 ). In this specific case, it is simple to identify the topological index. For the purpose of determining the aforementioned topological index, we only take into account the non-complete nonzero component union graphs of vector spaces.
Remark 1.
Let Λ be a vector space with O ( F ) = 𝒷 , d i m ( Λ ) = φ ( φ 1 ) and ℓ be an arbitrary vertex with skeleton ȷ . The distance between ℓ and V ( Γ ( Λ B ) ) is 1 or 2.
The count of vertices in distance 1 from ℓ is the degree of the vertex . By Theorem 4, the count of vertices at a distance of 2 from ℓ is
| V ( Γ ( Λ B ) ) | d ( ) 1 = 𝒷 φ 2 ( 𝒷 1 ) φ ȷ 𝒷 ȷ , i f   1 ȷ φ 1 0 , i f φ = ȷ .
Remark 2.
Let Λ be a vector space with O ( F ) = 𝒷 , d i m ( Λ ) = φ ( φ 1 ) and ℓ be an arbitrary vertex with skeleton ȷ . If the vertex is adjacent to any other vertex Γ ( Λ B ) , then | S B ( ) | φ ȷ . Moreover, ℓ has C ȷ t + ȷ φ ( 𝒷 1 ) t neighborhood vertices with skeleton t where φ ȷ t φ .
Remark 3.
We know that diameter of Γ ( Λ B ) is 2. Then,
d ( Γ ( Λ B ) , 1 ) = ( 𝒷 1 ) φ ( 𝒷 φ 2 ) + 1 2 ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ 𝒷 ȷ ( 𝒷 1 ) φ ȷ d ( Γ ( Λ B ) , 2 ) = 1 2 ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ 𝒷 φ 2 ( 𝒷 1 ) φ ȷ 𝒷 ȷ
Theorem 8.
If Γ ( Λ B ) is not complete, then the eccentricity of the vertex Γ ( Λ B ) with skeleton ȷ is
e c c ( ) = 2 , i f 1 ȷ φ 1 1 , i f φ = ȷ .
Proof. 
Let be an arbitrary vector with skeleton ȷ . If ȷ = φ , then by Theorem 4 e c c ( ) = 1 . If 1 ȷ φ 1 , then by Theorem 4, has non-adjacent vertices in Γ ( Λ B ) . Because by Theorem 1, e c c ( ) = 2 .
Theorem 9.
If Γ ( Λ B ) is not complete, then distance number of the vertex ℓ with skeleton ȷ is
D ( | ) = 2 ( 𝒷 φ 2 ) ( 𝒷 1 ) φ ȷ 𝒷 ȷ , i f   1 ȷ φ 1 𝒷 φ 2 , i f   φ = ȷ .
Proof. 
Let Γ be an arbitrary vector with skeleton ȷ .
If 1 ȷ φ 1 , because by Theorem 4 d ( ) is ( 𝒷 1 ) φ ȷ 𝒷 ȷ and by Theorem 1 gives
D ( | ) = ( 𝒷 1 ) φ ȷ 𝒷 ȷ + 2 ( 𝒷 φ 2 ( 𝒷 1 ) φ ȷ 𝒷 ȷ ) = ( 𝒷 1 ) φ ȷ 𝒷 ȷ + 2 ( 𝒷 φ 2 ) 2 ( ( 𝒷 1 ) φ ȷ 𝒷 ȷ ) D ( | ) = 2 ( 𝒷 φ 2 ) ( 𝒷 1 ) φ ȷ 𝒷 ȷ
If ȷ = φ , by Theorem 4
D ( | ) = 𝒷 φ 2 .
Remark 4.
Let Λ be a vector space with O ( F ) = 𝒷 , d i m ( Λ ) = φ ( φ 1 ) . By Theorem 5 | E ( Γ ( Λ B ) ) | = ( 𝒷 1 ) φ [ ( 𝒷 + 1 ) φ 3 ] 2 . Because ([13], p. 4) collection of an element with skeleton φ in Γ ( Λ B ) is the complete sub-graph of Γ ( Λ B ) .
Hence, the count of edges with both end vertices are having skeleton φ is ( 𝒷 1 ) φ ( 𝒷 1 ) φ 1 2 .
In addition, the count of edges with exactly one end vertex having skeleton φ is
( 𝒷 φ 2 ) ( 𝒷 1 ) φ + 1 ( 𝒷 1 ) φ = 𝒷 φ ( 𝒷 1 ) φ 1 ( 𝒷 1 ) φ
Finally, the count of edges on both ends are skeleton less than φ is
( 𝒷 1 ) φ [ ( 𝒷 + 1 ) φ 3 ] 2 ( 𝒷 φ 2 ) ( 𝒷 1 ) φ 1 ( 𝒷 1 ) φ ( 𝒷 1 ) φ ( 𝒷 1 ) φ 1 2 = ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ + ( 𝒷 1 ) φ 2 2 𝒷 φ + 1 .

4. Topological Index of Nonzero Component Union Graph of Vector Space

In this segment, we found the Wiener index, Wiener polynomial, Hyper-Wiener index and Zagreb index of Γ ( Λ B ) .
Theorem 10.
Let = Γ ( Λ B ) , then
W ( Γ ( Λ B ) ) = ( 𝒷 φ 2 ) 𝒷 φ ( 𝒷 1 ) φ 2 2 ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ 𝒷 φ 1
Proof. 
Remark 1 gives the following result.
W ( Γ ( Λ B ) ) = 1 2 [ ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ ( 𝒷 1 ) φ ȷ 𝒷 ȷ + 2 ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ 𝒷 φ 2 ( 𝒷 1 ) φ ȷ 𝒷 ȷ + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) ] W ( Γ ( Λ B ) ) = ( 𝒷 φ 2 ) 𝒷 φ ( 𝒷 1 ) φ 2 2 ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ 𝒷 φ 1 .
Now, consider the following Figure 1 to visualize W ( Γ ( Λ B ) ) with φ dimension over the field of order 𝒷 .
Theorem 11.
Let = Γ ( Λ B ) , then the first Zagreb index
M 1 ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ ( 𝒷 2 + 𝒷 1 ) φ ( 𝒷 1 ) φ 4 ( 𝒷 φ 1 )
Proof. 
Let = c 1 ϑ i 1 + c 2 ϑ i 2 + + c ȷ ϑ i ȷ be a vertex in Γ ( Λ B ) with c 1 , c 2 , , c ȷ 0 . Then, by Theorem 4, the degree of the vertex is d ( ) = ( 𝒷 1 ) φ ȷ 𝒷 ȷ if 1 ȷ φ ; 𝒷 φ 2 if ȷ = φ . Therefore, the first Zagreb index
M 1 ( Γ ( Λ B ) ) = ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ ( 𝒷 1 ) φ ȷ 𝒷 ȷ 2 + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) 2 = ( 𝒷 1 ) 2 φ ȷ = 1 φ 1 C φ ȷ 𝒷 2 𝒷 1 ȷ + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) 2 = ( 𝒷 1 ) 2 φ 𝒷 2 𝒷 1 + 1 φ 𝒷 2 𝒷 1 φ 1 + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) 2 M 1 ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ ( 𝒷 2 + 𝒷 1 ) φ ( 𝒷 1 ) φ 4 ( 𝒷 φ 1 ) .
Now, consider the following Figure 2 to visualize M 1 ( Γ ( Λ B ) ) with φ dimension over the field of order 𝒷 .
Because by using Remark 2, we have the following.
Theorem 12.
Let = Γ ( Λ B ) , then the second Zagreb index
M 2 ( Γ ( Λ B ) ) = 1 2 [ ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) φ 𝒷 ȷ t = φ ȷ φ 1 C φ | t + ȷ φ | ( 𝒷 1 ) φ 𝒷 t + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) φ 𝒷 ȷ + ( 𝒷 1 ) φ 1 ( 𝒷 φ 2 ) ]
Theorem 13.
Let = Γ ( Λ B ) , then the Wiener polynomial
W ( Γ ( Λ B ) ; x ) = 1 2 ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ 3 x + 1 2 ( 𝒷 φ 2 ) 𝒷 φ ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ x 2
Proof. 
By Remark 3, we have the following result:
W ( Γ ( Λ B ) ; x ) = ȷ = 1 d i a m ( Γ ( Λ B ) ) d ( Γ ( Λ B ) , ȷ ) x ȷ = d ( Γ ( Λ B ) , 1 ) x + d ( Γ ( Λ B ) , 2 ) x 2 = x 2 ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ ( 𝒷 1 ) φ ȷ 𝒷 ȷ + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) + x 2 2 ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ 𝒷 φ 2 ( 𝒷 1 ) φ ȷ 𝒷 ȷ = 1 2 ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ 3 x + ( 𝒷 φ 2 ) 𝒷 φ ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ x 2
Theorem 14.
Let = Γ ( Λ B ) , then the Hyper-Wiener index
W W ( Γ ( Λ B ) = 3 ( 𝒷 φ 2 ) 𝒷 φ 2 ( 𝒷 1 ) φ 3 1 2 ( 𝒷 1 ) φ ( ( 𝒷 + 1 ) φ 𝒷 φ 1 )
Proof. 
By Remark 3, we have the following result:
W W ( Γ ( Λ B ) = 1 2 ȷ = 1 d i a m ( Γ ( Λ B ) ) ȷ ( ȷ + 1 ) d ( Γ ( Λ B ) , ȷ ) = 1 2 2 d ( Γ ( Λ B ) , 1 ) + 6 d ( Γ ( Λ B ) , 2 ) = 1 2 [ 2 ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ ( 𝒷 1 ) φ ȷ 𝒷 ȷ + 2 ( 𝒷 1 ) φ ( 𝒷 φ 2 ) + 6 ȷ = 1 φ 1 C φ ȷ ( 𝒷 1 ) ȷ ( 𝒷 φ 2 ) ( 𝒷 1 ) φ ȷ 𝒷 ȷ ] = 3 ( 𝒷 φ 2 ) ( 𝒷 φ ( 𝒷 1 ) φ 1 ) 2 ( 𝒷 1 ) φ ( ( 𝒷 + 1 ) φ 1 𝒷 φ ) + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) = 3 ( 𝒷 φ 2 ) ( 𝒷 φ ( 𝒷 1 ) φ 1 + ( 𝒷 1 ) φ 3 ) 2 ( 𝒷 1 ) φ ( ( 𝒷 + 1 ) φ 1 𝒷 φ ) .
Now, consider the following Figure 3 to visualize W W ( Γ ( Λ B ) with φ dimension over the field of order 𝒷 .

5. Eccentricity Topological Indices

This section contains the vector space’s eccentricity-based topological index of the nonzero component union graph with d i m ( Λ ) = φ and O ( F ) = 𝒷 .
Theorem 15.
Let = Γ ( Λ B ) , then the eccentricity index.
ξ ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ 2 ( 𝒷 + 1 ) φ 𝒷 φ 4
Proof. 
By Theorem 8, we obtain the following relation:
ξ ( Γ ( Λ B ) ) = V ( Γ ( Λ B ) ) d ( ) e c c ( ) = 2 ȷ = 1 φ 1 ( 𝒷 1 ) φ ȷ C φ ȷ 𝒷 ȷ ( 𝒷 1 ) ȷ + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) = 2 ( 𝒷 1 ) φ ȷ = 1 φ 1 C φ ȷ 𝒷 ȷ + ( 𝒷 1 ) φ ( 𝒷 φ 2 ) ξ ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ 2 ( 𝒷 + 1 ) φ 𝒷 φ 4 .
Now, consider the following Figure 4 to visualize the eccentric-connectivity index of Γ ( Λ B ) .
Theorem 16.
Let = Γ ( Λ B ) , then the total eccentricity index.
ζ ( Γ ( Λ B ) ) = 2 ( 𝒷 φ 1 ) ( 𝒷 1 ) φ
Proof. 
By Theorem 8, we obtain the following relation:
ζ ( Γ ( Λ B ) ) = V ( Γ ( Λ B ) ) e c c ( ) = 2 ( 𝒷 φ 1 ) ( 𝒷 1 ) φ + ( 𝒷 1 ) φ ζ ( Γ ( Λ B ) ) = 2 ( 𝒷 φ 1 ) ( 𝒷 1 ) φ .
Now, consider the following Figure 5 to visualize the total eccentricity index of Γ ( Λ B ) .
Theorem 17.
If d i m ( Λ ) = φ and O ( F ) = 𝒷 , then
M 1 * ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ 2 ( 𝒷 + 1 ) φ ( 𝒷 1 ) φ 𝒷 φ 2
Proof. 
By Theorem 8 and Remark 4, we obtain
M 1 * ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ ( 𝒷 1 ) φ 1 + 3 ( 𝒷 φ 2 ) ( 𝒷 1 ) φ + 1 ( 𝒷 1 ) φ + 4 ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ + ( 𝒷 1 ) φ 2 2 𝒷 φ + 1 M 1 * ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ 2 ( 𝒷 + 1 ) φ ( 𝒷 1 ) φ 𝒷 φ 2 .
Theorem 18.
If d i m ( Λ ) = φ and O ( F ) = 𝒷 , then
M 1 * * ( Γ ( Λ B ) ) = 4 𝒷 φ 3 ( 𝒷 1 ) φ 4
Proof. 
By Theorem 8, we obtain the number of vertices having eccentricity 1 is ( 𝒷 1 ) φ and the number of vertices having eccentricity 2 is 𝒷 φ ( 𝒷 1 ) φ 1 .
M 1 * * ( Γ ( Λ B ) ) = 4 𝒷 φ ( 𝒷 1 ) φ 1 + ( 𝒷 1 ) φ M 1 * * ( Γ ( Λ B ) ) = 4 𝒷 φ 3 ( 𝒷 1 ) φ 4 .
Theorem 19.
Let = Γ ( Λ B ) , then
M 2 * ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ 2 ( 𝒷 + 1 ) φ 2 𝒷 φ 1
Proof. 
By Theorem 8 and Remark 4, we obtain
M 2 * ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ ( 𝒷 1 ) φ 1 + 2 ( 𝒷 φ 2 ) ( 𝒷 1 ) φ + 1 ( 𝒷 1 ) φ + 4 ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ + ( 𝒷 1 ) φ 2 2 𝒷 φ + 1 M 2 * ( Γ ( Λ B ) ) = ( 𝒷 1 ) φ 2 ( 𝒷 + 1 ) φ 2 𝒷 φ 1
Theorem 20.
Let = Γ ( Λ B ) , then average eccentricity index
a v e g ( Γ ( Λ B ) ) = 2 ( 𝒷 1 ) φ 𝒷 φ 1
Proof. 
By Theorem 8, we obtain the number of vertices having eccentricity 1 is ( 𝒷 1 ) φ and the number of vertices having eccentricity 2 is 𝒷 φ ( 𝒷 1 ) φ 1 .
a v e g ( Γ ( Λ B ) ) = 1 𝒷 φ 1 V ( Γ ( Λ B ) ) e c c ( ) = 2 ( 𝒷 φ 1 ) ( 𝒷 1 ) φ + ( 𝒷 1 ) φ 𝒷 φ 1 a v e g ( Γ ( Λ B ) ) = 2 ( 𝒷 1 ) φ 𝒷 φ 1
By Theorems 8 and 9, we obtain
Theorem 21.
Let = Γ ( Λ B ) , then eccentric distance sum index
ξ D S ( Γ ( Λ B ) ) = 4 ( 𝒷 φ 2 ) 𝒷 φ 3 4 ( 𝒷 1 ) φ 2 ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ 1 𝒷 φ
Proof. 
ξ D S ( Γ ( Λ B ) ) = V ( Γ ( Λ B ) ) e c c ( ) D ( | V ( Γ ( Λ B ) ) ) = ȷ = 1 φ 1 2 C φ ȷ ( 𝒷 1 ) ȷ 2 ( 𝒷 φ 2 ) ( 𝒷 1 ) φ ȷ 𝒷 ȷ + 𝒷 φ 2 = 4 ( 𝒷 φ 2 ) ȷ = 1 φ 1 2 C φ ȷ ( 𝒷 1 ) ȷ 2 ȷ = 1 φ 1 2 C φ ȷ ( 𝒷 1 ) φ 𝒷 ȷ + 𝒷 φ 2 ξ D S ( Γ ( Λ B ) ) = 4 ( 𝒷 φ 2 ) 𝒷 φ 3 4 ( 𝒷 1 ) φ 2 ( 𝒷 1 ) φ ( 𝒷 + 1 ) φ 1 𝒷 φ .
Because by the Remark 2, we have the following result.
Theorem 22.
Let = Γ ( Λ B ) , then A B C index
A B C ( Γ ( Λ B ) ) = 1 2 { [ ȷ = 1 φ 1 ( t = φ ȷ φ 1 C ȷ | t + ȷ φ | ( 𝒷 1 ) t ( 𝒷 1 ) φ ȷ 𝒷 ȷ + ( 𝒷 1 ) φ t 𝒷 t 2 ( 𝒷 1 ) φ ȷ 𝒷 ȷ ( 𝒷 1 ) φ t 𝒷 t + ( 𝒷 1 ) φ ( 𝒷 1 ) φ ȷ 𝒷 ȷ + ( 𝒷 φ 2 ) 2 ( 𝒷 1 ) φ ȷ 𝒷 ȷ ( 𝒷 φ 2 ) ) ] + ȷ = 1 φ 1 ( 𝒷 1 ) ȷ ( 𝒷 1 ) φ ȷ 𝒷 ȷ + ( 𝒷 φ 2 ) 2 ( 𝒷 1 ) φ ȷ 𝒷 ȷ 𝒷 φ 2 + ( 𝒷 1 ) φ ( 𝒷 1 ) φ 1 2 ( 𝒷 φ 2 ) 2 ( 𝒷 φ 2 ) 2 }
Example 1.
Let us consider the following Figure 6 illustrating the Γ ( Λ B ) of the dimension φ = 4 over the field of order 𝒷 = 2 .
Now, the following Table 1 gives the information about some topological index of nonzero component union graph of vector space.

6. Conclusions

In this paper, we found the topological indices of nonzero component union graphs from vector spaces Λ with order n over the field F with order 𝒷 , and we give the general formula and a comparison table for finding a different topological index to the number of graphs constructed from the vector space. Depending on the respective quantitative data, these resulting indices are graphically contrasted. Future scholars can build on our research of the indices for these structures to find and investigate other algebraic structures and their features.

Author Contributions

Conceptualization, K.M. and S.G.; methodology, K.M.; software, S.G.; validation, K.L., N.A. and S.G.; formal analysis, K.L; investigation, N.A.; resources, K.L.; data curation, N.A.; writing—original draft preparation, S.G; writing—review and editing, K.L. and N.A.; visualization, K.L.; supervision, K.L.; project administration, N.A.; funding acquisition, N.A. All authors have read and agreed to the published version of the manuscript.

Funding

Princess Nourah Bint Abdulrahman University Researchers Supporting Project number (PNURSP2023R59), Princess Nourah Bint Abdulrahman University, Riyadh, Saudi Arabia.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

Princess Nourah Bint Abdulrahman University Researchers Supporting Project number (PNURSP2023R59), Princess Nourah Bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bondy, J.A.; Murty, U.S.R. Graph Theory with Applications; Elsevier: Amsterdam, The Netherlands, 1986. [Google Scholar]
  2. Behmaram, A.; Azari, H.; Ashrafi, A. Some New Resulutes on Distance-Based Polynomials. MATCH Commun. Math. Comput. Chem. 2011, 65, 39–50. [Google Scholar]
  3. Farooq, R.; Malik, M.A. On some eccentricity based topological index of nanostar dendrimers. Optoelectron. Adv. Mater. Rapid Commun. 2015, 9, 842–849. [Google Scholar]
  4. Ghorbani, M.; Hosseinzadeh, M.A. A new version of Zagreb index. Filomat 2012, 26, 93–100. [Google Scholar] [CrossRef] [Green Version]
  5. Guirao, J.L.G.; Imran, M.; Siddiqui, M.K.; Akhter, S. On Valency-Based Molecular Topological Descriptors of Subdivision Vertex-Edge Join of Three Graphs. Symmetry 2020, 12, 1026. [Google Scholar] [CrossRef]
  6. Gupta, S.; Singh, M.; Madan, A.K. Eccentric distance sum: A novel graph invariant for predicting biological and physical properties. J. Math. Anal. Appl. 2002, 275, 386–401. [Google Scholar] [CrossRef] [Green Version]
  7. Jia-Bao, L.; Khalid, I.; Rahim, M.T.; Rehman, M.U.; Ali, F.; Salman, M. Eccentric topological properties of a graph associated to a finite dimensional vector space. Main Group Met. Chem. 2020, 43, 164–176. [Google Scholar]
  8. Khalifeh, M.; Azari, H.; Ashrafi, A. The hyper-Wiener index of graph operations. Comput. Math. Appl. 2008, 56, 1402–1407. [Google Scholar] [CrossRef] [Green Version]
  9. Mohar, B.; Thomassen, C. Graphs on Surfaces; Johns Hopkins University Press: Baltimore, MD, USA, 2001. [Google Scholar]
  10. Skorobogatov, V.A.; Dobrynin, A.A. Metric analysis of graphs. MATCH Commun. Math. Comput. Chem. 1988, 23, 105–151. [Google Scholar]
  11. Trinajstic, N. Chemical Graph Theory; CRC Press Inc.: Boca Raton, FL, USA, 1983; Volume 2. [Google Scholar]
  12. Xing, R.; Zhou, B.; Dong, F. On atom-bond connectivity index of connected graphs. Discret. Appl. Math. 2011, 159, 1617–1630. [Google Scholar] [CrossRef]
  13. Das, A. Non-zero component union graph of a finite-dimensional vector space. Linear Multilinear Algebra 2017, 65, 1276–1287. [Google Scholar] [CrossRef]
  14. Das, A. Nonzero Component graph of a finite dimensional vector space. Commun. Algebra 2016, 44, 3918–3926. [Google Scholar] [CrossRef] [Green Version]
  15. Kalaimurugan1, G.; Gopinath, S. Subset based non-zero component union graphs of vector spaces. Adv. Math. Sci. J. 2021, 10, 2561–2569. [Google Scholar] [CrossRef]
  16. Kalaimurugan, G.; Gopinath, S.; Chelvam, T.T. Genus of non-zero component union graphs of vector spaces. Hacet. J. Math. Stat. 2021, 50, 1595–1608. [Google Scholar] [CrossRef]
  17. Chelvam, T.T.; Ananthi, K.P. On the genus of graphs associated with vector spaces. J. Algebra Its Appl. 2020, 19, 2050086. [Google Scholar] [CrossRef]
  18. Cash, G. Relationship between the hosoya polynomial and the hyper-wiener index. Appl. Math. Lett. 2002, 15, 893–895. [Google Scholar] [CrossRef]
Figure 1. Wiener index of Γ ( Λ B ) .
Figure 1. Wiener index of Γ ( Λ B ) .
Mathematics 11 00295 g001
Figure 2. First Zagreb index of Γ ( Λ B ) .
Figure 2. First Zagreb index of Γ ( Λ B ) .
Mathematics 11 00295 g002
Figure 3. Hyper-Wiener index of Γ ( Λ B ) .
Figure 3. Hyper-Wiener index of Γ ( Λ B ) .
Mathematics 11 00295 g003
Figure 4. Eccentricity index of Γ ( Λ B ) .
Figure 4. Eccentricity index of Γ ( Λ B ) .
Mathematics 11 00295 g004
Figure 5. Total eccentricity index of Γ ( Λ B ) .
Figure 5. Total eccentricity index of Γ ( Λ B ) .
Mathematics 11 00295 g005
Figure 6. Γ ( Λ B ) with φ = 4 and 𝒷 = 2 .
Figure 6. Γ ( Λ B ) with φ = 4 and 𝒷 = 2 .
Mathematics 11 00295 g006
Table 1. Topological index of Γ ( Λ B ) .
Table 1. Topological index of Γ ( Λ B ) .
𝒷 Index φ = 2 φ = 3 φ = 4
2 W ( Γ ( Λ B ) ) 227153
W W ( Γ ( Λ B ) ) 678747
ξ ( Γ ( Λ B ) ) 1042142
ζ ( Γ ( Λ B ) ) 51329
a v e g ( Γ ( Λ B ) ) 1.6661.8571.933
ξ D S ( Γ ( Λ B ) ) 10114670
3 W ( Γ ( Λ B ) ) 323123030
W W ( Γ ( Λ B ) ) 6497410,864
ξ ( Γ ( Λ B ) ) 767766832
ζ ( Γ ( Λ B ) ) 1244144
a v e g ( Γ ( Λ B ) ) 1.51.6921.8
ξ D S ( Γ ( Λ B ) ) 71124914,735
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Mageshwaran, K.; Alessa, N.; Gopinath, S.; Loganathan, K. Topological Indices of Graphs from Vector Spaces. Mathematics 2023, 11, 295. https://doi.org/10.3390/math11020295

AMA Style

Mageshwaran K, Alessa N, Gopinath S, Loganathan K. Topological Indices of Graphs from Vector Spaces. Mathematics. 2023; 11(2):295. https://doi.org/10.3390/math11020295

Chicago/Turabian Style

Mageshwaran, Krishnamoorthy, Nazeek Alessa, Singaravelu Gopinath, and Karuppusamy Loganathan. 2023. "Topological Indices of Graphs from Vector Spaces" Mathematics 11, no. 2: 295. https://doi.org/10.3390/math11020295

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop