Prime labeling in the context of duplication of graph elements Page 1 International Journal
of Mathematics and Soft Computing Vol.3, No.1 (2013), 13 - 20. ISSN Print : 2249 - 3328 …

The main purpose of the current work is to create new directions for gaining knowledge in
the arena of graph labeling. Graph labeling is helpful to assign values (labels), with some …

A. The edge hub-integrity of a graph is given by the minimum of| S|+ m (G− S), where S is an
edge hub set and m (G− S) is the maximum order of the components of G− S. This paper …

The field of computer vision studies the computational tools and methods required for
computers to be able to process visual information, for example images and video. Shape …

Necessary Condition for Mean Labeling Page 1 International Journal of Engineering Science,
Advanced Computing and Bio-Technology Vol. 4, No. 3, July – September 2013, pp. 43 - 52 …

Elixir Journal Page 1 SK Vaidya et al./ Elixir Dis. Math. 48 (2012) 9482-9485 9482 Introduction
We begin with simple, finite, connected and undirected graph ( ( ), ( )) GVGEG = . The members …

A graph 𝐺=(𝑝, 𝑞) with 𝑝 vertices and 𝑞 edges is said to have a Difference Perfect Square
Cordial labeling if there exists a bijection 𝑓: 𝑉 (𝐺)→{1, 2, 3,…, 𝑝} such that for each edge 𝑒 …

GRAPH THEORY - DISCUSSION AND SOME NEW RESULTS Page 1 Annexure 145 Page 2
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 3, No. 3; August 2011 Product …

Some results and examples on difference cordial graphs Page 1 Turkish Journal of Mathematics
Volume 40 Number 2 Article 16 1-1-2016 Some results and examples on difference cordial …

The concept of hop hub-integrity is introduced as a new measure of the stability of a graph G
and it is defined as HhI (G)= min {| S|+ m (G− S)}, where S is hop hub set and m (G− S) is the …