Even Vertex Graceful of Path, Circuit, Star, Wheel, some Extension-friendship Graphs and Helm Graph
نویسندگان
چکیده
منابع مشابه
Some Graph Operations Of Even Vertex Odd Mean Labeling Graphs
A graph with p vertices and q edges is said to have an even vertex odd mean labeling if there exists an injective function f:V(G){0, 2, 4, ... 2q-2,2q} such that the induced map f*: E(G) {1, 3, 5, ... 2q-1} defined by f*(uv)= f u f v 2 is a bijection. A graph that admits an even vertex odd mean labeling is called an even vertex odd mean graph. In this paper we pay our attention to p...
متن کاملSuper Vertex Graceful Graphs
For a defined graph labeling, there exists a number of bijective functions for a graph of defined order and size which leads to different graphs. In this paper, a mathematical tool is developed to find the number of super vertex graceful graphs for a defined order “p” and size “q”. Mathematics Subject Classification: 05C78
متن کامل4-Prime cordiality of some cycle related graphs
Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivison of a star, bistar, double comb, corona of tree with a vertex, crown, olive tree and other standard graphs were studied. Also four prime cordial labeling behavior of complete graph, book, flower were studied. In this paper, we investigate the four prime cordial labeling behavior of corona of wh...
متن کاملDouble-Wheel Graphs Are Graceful
We present the first polynomial time construction procedure for generating graceful double-wheel graphs. A graph is graceful if its vertices can be labeled with distinct integer values from {0, ..., e}, where e is the number of edges, such that each edge has a unique value corresponding to the absolute difference of its endpoints. Graceful graphs have a range of practical application domains, i...
متن کاملSome New Families of Total Vertex Product Cordial Labeling Of Graphs
I.Cahit introduced cordial graphs as a weaker version of graceful and harmonious graphs. The total product cordial labeling is a variant of cordial labeling. In this paper we introduce a vertex analogue product cordial labeling as a variant of total product cordial labeling and name it as total vertex product cordial labeling. Finally, we investigate total vertex product cordial labeling for ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/1488-2005