scispace - formally typeset
Open AccessJournal ArticleDOI

Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs

TLDR
In this paper, an edge irregular reflexive k-labeling for disjoint association of wheel-related diagrams and deduce the correct estimation of the reflexive edge strength for the m copies of some wheelrelated graphs, specifically gear graphs and prism graphs.
Abstract
In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks. A diagram with such a capacity characterized defined is known as a vertex-marked graph. Similarly, an edge naming is a mapping of an element of E to an arrangement of marks. In this case, the diagram is called an edge-marked graph. We consider an edge irregular reflexive k-labeling for the disjoint association of wheel-related diagrams and deduce the correct estimation of the reflexive edge strength for the disjoint association of m copies of some wheel-related graphs, specifically gear graphs and prism graphs.

read more

Citations
More filters
Journal ArticleDOI

Topological properties of benzenoid, phenylenes and nanostar dendrimers

TL;DR: A variety of dendrimers exist, and each has biological properties such as polyvalency, selfassembling, electrostatic interactions, chemical stability, low cytotoxicity, and solubility.
Journal ArticleDOI

Modified eccentric descriptors of crystal cubic carbon

TL;DR: In this article, the structural properties of a molecular graph are analyzed. But the authors focus on the covalent properties of the molecular graph and do not consider the non-covalent structure of the graph.
Journal ArticleDOI

On the M-polynomials and degree-based topological indices of an important class of graphs

TL;DR: M-polynomial of chemical compounds is a recent idea and produces closed forms of many degree-based topological indices which correlate chemical properties of material under investigation as discussed by the authors, which can be used to find chemical compounds.
Journal ArticleDOI

Vertex Szeged index of crystal cubic carbon structure

TL;DR: The molecular topological indices as mentioned in this paper are the numerical invariants of a molecular graph and are used to model and design any chemical structure or network, and they play an important role in modeling and designing chemical structures or networks.
Journal ArticleDOI

Some reversed degree-based topological indices for graphene

TL;DR: In this article, the reverse degree based topological indices are discussed and compared with the traditional reverse degree-based topology indices, which are numerical values that correlate the chemical structures with physical properties.
References
More filters
Journal ArticleDOI

On irregular total labellings

TL;DR: Two new graph characteristics, the total vertex irregularity strength and the total edge irregularitystrength, are introduced andEstimations on these parameters are obtained.
Journal ArticleDOI

A Tight Bound on the Irregularity Strength of Graphs

TL;DR: The congruence method is refined in the disconnected case and it is shown that s (G) \leq n-1$ holds for all graphs with s(G) finite, except for K3, which settles a conjecture of Aigner and Triesch.
Journal ArticleDOI

Irregularity strength of trees

TL;DR: It is established that the irregularity strength of any tree with no vertices of degree two is its number of pendant vertices, which is proportional to the number of vertices in the tree.
Journal ArticleDOI

Total edge irregularity strength of generalized prism

TL;DR: This paper determines the exact value of the total edge irregularity strength of the generalized prism P n m, the Cartesian product C n □ P m of a cycle on n vertices with a path on m vertices.
Journal ArticleDOI

On Edge Irregular Total Labeling of Categorical Product of Two Cycles

TL;DR: The exact value of the total edge irregularity strength of the categorical product of two cycles Cn and Cm, for n,m≥3, is determined.
Related Papers (5)