Computing F-Index of Different Corona Products of Graphs

De, Nilanjan

doi:10.18052/www.scipress.com/bmsa.19.24

Cited by 9 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2018, Nilanjan De uses modern index to calculate the F-index and co index of some derived graphs [7,8]. Its special of First general Zagreb index where…”

Section: Original Research Articlementioning

confidence: 99%

Computing Y-index of Different Corona Products of Graphs

Nagarajan,

Durga

2023

ARJOM

View full text Add to dashboard Cite

The Y-index of a graph is defined by the sum of four of degrees of the vertices of a graph. Among the all topological indices the Zagreb indices have been used more considerably than any other topological indices in chemical literature. The concept of Corona Product is a recent inclusion to mathematical vocabulary. One of the most significant graph operations is the corona product of several generic and specific graphs, which is one of the most well-known graph products. In this study, we derive some explicit formulations of several corona product types, including subdivision-vertex corona, subdivision-edge corona, subdivision-vertex neighborhood corona, subdivision-edge neighborhood corona, and vertex-edge corona of two graphs.

show abstract

“…In 2018, Nilanjan De uses modern index to calculate the F-index and co index of some derived graphs [7,8]. Its special of First general Zagreb index where…”

Section: Original Research Articlementioning

confidence: 99%

Computing Y-index of Different Corona Products of Graphs

Nagarajan,

Durga

2023

ARJOM

View full text Add to dashboard Cite

show abstract

“…As other structures, graphs can also be operated in such a way from two, given a third one is obtained (a graph product). Among these binary operations, there are some that are well known and that have been studied and investigated from different perspectives, for example: the total Roman domination number of the lexicographic product of graphs is studied in reference [18]; the exact value of the edge irregularity strength of the corona product of paths is determined in reference [19]; explicit expressions for the F-index of different types of corona product are derived in reference [20]; the super fair dominating sets of the corona and lexicographic product of two graphs are characterized in reference [21]; some tight bounds and closed formulas for the strong metric dimension of the Cartesian sum of graphs, in terms of some parameters of the factors, are obtained in reference [22]; and explicit expressions for the Schultz index of the Cartesian, corona, and lexicographic product, and the Cartesian sum, are given in reference [23].…”

Section: Introductionmentioning

confidence: 99%

The Clustering Coefficient for Graph Products

Aguilar-Alarcón,

Hernández-Gómez,

Romero-Valencia

2023

Axioms

View full text Add to dashboard Cite

The clustering coefficient of a vertex v, of degree at least 2, in a graph Γ is obtained using the formula C(v)=2t(v)deg(v)(deg(v)−1), where t(v) denotes the number of triangles of the graph containing v as a vertex, and the clustering coefficient of Γ is defined as the average of the clustering coefficient of all vertices of Γ, that is, C(Γ)=1|V|∑v∈VC(v), where V is the vertex set of the graph. In this paper, we give explicit expressions for the clustering coefficient of corona and lexicographic products, as well as for the Cartesian sum; such expressions are given in terms of the order and size of factors, and the degree and number of triangles of vertices in each factor.

show abstract

“…Throughout the paper, we only consider simple graphs without isolated vertex. The study on topological indices and its properties are growing vastly, thus many results can be found, for instance in [10], [21], [26], and [20]. Now we recall some well known topological indices.…”

Section: Introductionmentioning

confidence: 99%

Semi-Total Point Graph of Neighbourhood Edge Corona Graph of G and H

Agustin¹,

Maragadam²,

Dafik

et al. 2023

Eur. J. Pure Appl. Math.

View full text Add to dashboard Cite

A topological index is a function having a set of graphs as its domain and a set of real numbers as its range. Here we concentrated on topological indices involving the number of vertices, the number of edges and the maximum and minimum vertex degree. The aim of this paper is to compute the lower and upper bounds of the second Zagreb index, third Zagreb index, Hyper Zagreb index, Harmonic index, Redefined first Zagreb index, First reformulated Zagreb index, Forgotten topological index, square F-index, Sum-connectivity index, Randic index, Reciprocal Randic index, Gourava index, Sombar index, Nirmala index, Geometric-Arithmetic index and lower bonds of Atom bond connectivity index, Redefined second Zagreb.

show abstract

Computing F-Index of Different Corona Products of Graphs

Cited by 9 publications

References 11 publications

Computing Y-index of Different Corona Products of Graphs

Computing Y-index of Different Corona Products of Graphs

The Clustering Coefficient for Graph Products

Semi-Total Point Graph of Neighbourhood Edge Corona Graph of G and H

Contact Info

Product

Resources

About