A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

A simple graph is called cordial if it admits 0‐1 labeling that satisfies certain conditions. The
second order of lemniscate graph is a graph of two second order of circles that have one …

Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has caused the global
pandemic, coronavirus disease-2019 (COVID-19) which has resulted in 60.4 million …

In this study, we propose a new kind of graph labeling which we call logic labeling and
investigate the logically labeling of the corona between paths Pn and cycles Cn, namely …

We have obtained graph-theoretically based topological indices for the characterization of
certain graph theoretical networks of biochemical interest. We have derived certain distance …

Let Γ=(V Γ, E Γ) be a simple undirected graph with finite vertex set V Γ and edge set E Γ. A
total n-labeling α: V Γ∪ E Γ→{1, 2,…, n} is called a total edge irregular labeling on Γ if for …

The existence of an orthogonal labelling of a graph G with respect to a certain group implies
the existence of the cyclic orthogonal double cover of the Circulant graphs on that group. In …

Abstract A function f: V (G)[E (G)[R (G)! C is said to be perfect coloring of the graph G, if f (x)
6= f (y) for any two adjoint or incident elements x, y 2 V (G)[E (G)[R (G). And the PC number …

Ostrowski-type inequality is known as the estimate deviation of the function from its mean
value using different characteristics of the functions. The inequalities have many …

A proper vertex coloring of a graph G is equitable if the sizes of any two color classes differ
by at most one. The equitable chromatic number of a graph G, denoted by X< sub>=(G), is …