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 …

Let Ph be a path on h vertices. A simple graph G=(V, E) admits a Ph-covering if every edge
in E belongs to a subgraph of G that is isomorphic to Ph. G is called Ph-magic if there is a …

Graph embeddings play a significant role in the design and analysis of parallel algorithms. It
is a mapping of the topological structure of a guest graph G into a host graph H, which is …

A graph G is called super edge-magic if there exists a one-to-one mapping f from V (G)∪ E
(G) onto {1, 2, 3,⋯,| V (G)|+| E (G)|} such that for each uv∈ E (G), f (u)+ f (uv)+ f (v)= c (f) is …

The nullity n0 of a graph G is the algebraic multiplicity of the number zero in the spectrum of
G. The energy E of G is the sum of absolute values of the eigenvalues of G. A long–open …

On super edge-magic total labeling on subdivision of trees Page 1 On super edge-magic
total labeling on subdivision of trees M. Javaid1, M. Hussain2, K. Ali2, H. Shaker2 1 …

In this paper we study depth and Stanley depth of the quotient rings of the edge ideals
associated with the corona product of some classes of graphs with arbitrary non-trivial …

In this paper we introduced the new notion of an even edge magic total labeling of some-
regular graphs. An edge magic total labeling of a graph is said to be an even edge magic …

It is well known that all starlike trees, ie trees with exactly one vertex of degree at least three,
are determined by their Laplacian spectrum. A double starlike tree is a tree with exactly two …

Many interesting systems in several disciplines can be modeled as networks of nodes that
can store and exchange data: pervasive systems, edge computing scenarios, and even …