Filters








498,541 Hits in 4.7 sec

Pair Sum Labeling of some Special Graphs

K. Manimekalai, K. Thirusangu
2013 International Journal of Computer Applications  
In this paper we study about the pair sum labeling of the coconut tree CT(m, n), the Y-tree Y n+1 , the Jelly fish graph J(m, n), the (m, 2)-kite, (m, 1)-kite, the theta graph Ѳ(l [m] ), for m even and  ...  ., p} is said to be a pair sum labeling if the induced edge function, f e : E(G)  Z -{0} defined by f e (uv) = f(u) + f(v) is one-one and f e (E(G)) is either of the form {k 1 , k 2 , ..., k q/2 }  ...  A graph with a pair sum labeling defined on it is called a pair sum graph.  ... 
doi:10.5120/11863-7647 fatcat:mwoz6f5fr5altldlbbxyejua5e

Pair Sum Labeling Of Some Special Graphs

Manimekalai K, Thirusangu K
2013 International Journal of Computing Algorithm  
In this paper we study about the pair sum labeling of the coconut tree CT(m, n), the Y-tree Y n+1 , the Jelly fish graph J(m, n), the (m, 2)-kite, (m, 1)-kite, the theta graph Ѳ(l [m] ), for m even and  ...  ., p} is said to be a pair sum labeling if the induced edge function, f e : E(G)  Z -{0} defined by f e (uv) = f(u) + f(v) is one-one and f e (E(G)) is either of the form {k 1 , k 2 , ..., k q/2 }  ...  A graph with a pair sum labeling defined on it is called a pair sum graph.  ... 
doi:10.20894/ijcoa.101.002.002.003 fatcat:zn2eawmxmraorbl6ntig2uqv24

Pair L(2,1)-labelings of infinite graphs

Roger K. Yeh
2018 Discussiones Mathematicae Graph Theory  
An L(2, 1)-labeling of a graph G = (V, E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are  ...  This article studies a generalization of the L(2, 1)-labeling. We assign sets with at least one element to vertices of G under some conditions.  ...  Pair L(2, 1)-Labelings of Infinite Graphs  ... 
doi:10.7151/dmgt.2077 fatcat:276vc6c7fzevleoq5z4r7po2su

Some Results On Pair Sum Labeling Of Graphs

R. Ponraj, J. Vijaya Xavier Parthipan, R. Kala
2010 Zenodo  
The symbols V (G) and E(G) will denote the vertex set and edge set of a graph G. p and q denote respectively the number of vertices and edges of G.  ...  The graphs considered here will be finite, undirected and simple.  ...  Here we study pair sum labeling of union of some standard graphs and we find the maximum size of a pair sum graph.  ... 
doi:10.5281/zenodo.825488 fatcat:xa5m3a7rabfqbhu3akz4i6tx6u

Some Results On Pair Sum Labeling Of Graphs

R. Ponraj, Xavier Parthipan, J. Vijaya, R. Kala
2010 Zenodo  
The graphs considered here will be finite, undirected and simple.  ...  Here we study pair sum labeling of union of some standard graphs and we find the maximum size of a pair sum graph.  ...  The notion of pair sum labeling has been introduced in [4] . In [4] we investigate the pair sum labeling behavior of complete graph, cycle, path, bistar etc.  ... 
doi:10.5281/zenodo.9567 fatcat:a4c65nstlbeo5cuyqdg4fc3fcy

ENCRYPTING NUMBERS USING PAIR LABELING IN PATH GRAPHS

J.B. Babujee, V. Vishnupriya
2017 International Journal of Pure and Applied Mathematics  
In this paper, we give a new combinatorial technique to encrypt and decrypt numbers through labeled graphs using the residue modulo class Z3.  ...  Now a day's most of the fields say clients' credit card numbers, social security numbers, tax file numbers etc needs to be kept secret when they send it electronically.  ...  Babitha has introduced pair labeling in graphs to encrypt and decrypt numbers using Number Theory technique in complete graph k 9 .  ... 
doi:10.12732/ijpam.v114i2.8 fatcat:yaa6tsymc5gplbpn55hkthz3ki

Labelling algorithms for paired-domination problems in block and interval graphs

Lei Chen, Changhong Lu, Zhenbing Zeng
2008 Journal of combinatorial optimization  
The paired-domination problem is to determine the paired-domination number, which is the minimum cardinality of a paired-dominating set.  ...  In addition, we prove that paired-domination problem is NP-complete for bipartite graphs, chordal graphs, even for split graphs.  ...  Acknowledgements The Authors would like to thank the referees for the careful reading of the manuscript, in particular, for their suggestions on improving the presentation of the results.  ... 
doi:10.1007/s10878-008-9177-6 fatcat:ixizlfrwgvckpkxd5eiconmtfm

Extracting Translation Pairs from Comparable Corpora through Graph-based Label Propagation

Akihiro Tamura, Taro Watanabe, Eiichiro Sumita, Hiroya Takamura, Manabu Okumura
2013 Journal of Natural Language Processing  
This paper proposes a novel method for bilingual lexicon extraction from comparable corpora using graph-based label propagation.  ...  The use of comparable corpora is motivated by the availability of large parallel corpora only for a few language pairs and limited domains.  ...  Seed Propagation LP is a graph-based technique that transfers labels from labeled to unlabeled data to infer labels for unlabeled data.  ... 
doi:10.5715/jnlp.20.133 fatcat:vdh5zf5htrhdvc6spel5i3hmum

Edge pair sum labeling of spider graph

P Jeyanthi, T Saratha, Devi
unpublished
A graph with a pair sum labeling, it is called a pair sum graph. Analogous to pair sum labeling we define a new labeling called an edge pair sum labeling in [3] and further studied in [4] - [7] .  ...  The symbols V (G) and E(G) denote the vertex set and edge set of a graph. R. Ponraj et. al. introduced the concept of pair sum labeling in [8] .  ... 
fatcat:ypne43fh2fcgbbh44dsz7oluv4

Edge pair sum labeling of some cycle related graphs

P Jeyanthi, T Saratha, Devi
unpublished
Hence f is an edge pair sum labeling. The example for the edge pair sum graph labeling of D(T 5 ) is shown in Figure 3 . Theorem 3. The wheel graph W n is an edge pair sum graph.  ...  Figure 6 : 6 Edge pair sum labeling for the graph F l 5 Figure 7 : 7 Edge pair sum labeling for the graph F l 6 are the vertices and edges of the graph C m , K 1,n .  ...  In [3] we have proved that C m is and edge pair sum graph for m ≥ 3. Let f be an edge pair sum labeling of C m .  ... 
fatcat:6lnsbp5ljvg3jmnphcbc3hl3ha

Edge Pair Sum Labeling

P. Jeyanthi, T. S. Devi
2013 Journal of Scientific Research  
A graph with an edge pair sum labeling is called an edge pair sum graph. In this paper we prove that path , cycle , triangular snake, , are edge pair sum graphs.  ...  An injective map f : E(G) → is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function defined by is oneone, where denotes the set of edges in G that are incident with a  ...  Hence, is an edge pair sum graph.  Observation 2.7: If G(p, q) is r-regular edge pair sum graph with even number of vertices then . Proof: Let f be an edge pair sum labeling of G.  ... 
doi:10.3329/jsr.v5i3.15001 fatcat:t5r2y7t2ifa6rj43gi3u5qxgqm

Super Vertex Graceful Graphs

N. Murugesan, R. Uma
2017 Communications on Applied Electronics  
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".  ...  The induced edge labels and the set of ordered pairs are tabulated in table 4.Let us consider the following set of ordered pairs which induce the labels 0 to form super vertex graceful graph of order  ... 
doi:10.5120/cae2017652560 fatcat:w4ys6lyqmnchxieajp3qhb6dgm

A Note on Pair Sum Graphs

R. Ponraj, J. X. V. Parthipan, R. Kala
2011 Journal of Scientific Research  
Here we prove that every graph is a subgraph of a connected pair sum graph. Also we investigate the pair sum labeling of some graphs which are obtained from cycles.  ...  Finally we enumerate all pair sum graphs of order ≤ 5.  ...  Clearly this vertex labeling is a pair sum labeling of G * . Theorem 2.3: If G is a pair sum graph then G ∪ mK 1 is also a pair sum graph. Proof: Let ƒ be a pair sum labeling of G.  ... 
doi:10.3329/jsr.v3i2.6290 fatcat:okpqvmcl6vajtlyxie7ounnzxa

Some New Families of Prime Cordial Graphs

S K Vaidya, N H Shah
2011 Journal of Mathematics Research  
Moreover we prove that the graphs obtained by mutual duplication of a pair of edges as well as mutual duplication of a pair of vertices from each of two copies of cycle C n admit prime cordial labeling  ...  We also show that the shadow graph of K 1,n for n ≥ 4 and the shadow graph of B n,n are prime cordial graphs.  ...  Acknowledgement The authors are highly thankful to anonymous referees for their suggestions and critical comments which led to substantial Published by Canadian Center of Science and Education  ... 
doi:10.5539/jmr.v3n4p21 fatcat:mmf4ldmkqrhvvf47xfdaw6vxsm

Checking Graph Programs for Confluence [chapter]

Ivaylo Hristakiev, Detlef Plump
2018 Lecture Notes in Computer Science  
joinable, and our previous results on the completeness and finiteness of the set of symbolic critical pairs.  ...  We present a method for statically verifying confluence (functional behaviour) of terminating sets of rules in the graph programming language GP 2, which is undecidable in general.  ...  Labelled graphs.  ... 
doi:10.1007/978-3-319-74730-9_8 fatcat:riyajmwvivbutjzm5elmczvjxa
« Previous Showing results 1 — 15 out of 498,541 results