منابع مشابه
Edge pair sum labeling of spider graph
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...
متن کاملedge pair sum labeling of spider graph
an injective map f : e(g) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph g(p, q) if the induced vertex function f*: v (g) → z − {0} defined by f*(v) = (sigma e∈ev) f (e) is one-one, where ev denotes the set of edges in g that are incident with a vetex v and f*(v (g)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} u {k(p+1)/2} accordin...
متن کاملCombining Graph Labeling and Compaction
Combinations of graph drawing and map labeling problems yield challenging mathematical problems and have direct applications, e.g., in automation engineering. We call graph drawing problems in which subsets of vertices and edges need to be labeled graph labeling problems. Unlike in map labeling where the position of the objects is specified in the input, the coordinates of vertices and edges in...
متن کاملRadio Labeling Cartesian Graph Products
Radio labeling is derived from the assignment of radio frequencies (channels) to a set of transmitters. The frequencies assigned depend on the geographical distance between the transmitters: the closer two transmitters are, the greater the potential for interference between their signals. Thus when the distance between two transmitters is small, the difference in the frequencies assigned must b...
متن کاملMcKay’s Canonical Graph Labeling Algorithm
The problem of deciding whether two graphs are isomorphic is fundamental in graph theory. Moreover, the flexibility with which other combinatorial objects can be modeled by graphs has meant that efficient programs for deciding whether graphs are isomorphic have also been used to study a variety of other combinatorial structures. Not only is the graph isomorphism problem a very practical one, it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/27