On P 2 P n -Supermagic Labeling of Edge Corona Product of Cycle and Path Graph
|
|
- Brianne McDonald
- 5 years ago
- Views:
Transcription
1 On P P n -Supermagic Labeling of Edge Corona Product of Cycle and Path Graph Riza Yulianto and Titin Sri Martini Mathematics Department of Mathematics and Natural Sciences Faculty, Universitas Sebelas Maret, Surakarta, Indonesia yuliantoriza48@gmail.com, titinsmartini@gmail.com Abstract. A simple graph G = (V, E) admits a H-covering, where H is subgraph of G, if every edge in E belongs to a subgraph of G isomorphic to H. Graph G is H-magic if there is a total labeling f : V (G) E(G) 1,,..., V (G) + E(G), such that each subgraph H = (V, E ) of G isomorphic to H and satisfying f(h ) def = Σ vϵv f(v) + Σ eϵe f(e) = m(f) where m(f) is a constant magic sum. Additionaly, G admits H-supermagic if f(v ) = 1,,..., V. The edge corona C n P n of C n and P n is defined as the graph obtained by taking one copy of C n and n copies of P n, and then joining two end-vertices of the i-th edge of C n to every vertex in the i-th copy of P n. This research aim is to find H-supermagic covering on an edge corona product of cycle and path graph C n P n where H is P P n. We use k-balanced multiset to solve our reserarch. Here, we find that an edge corona product of cycle and path graph C n P n is P P n supermagic for n Introduction Let G be a simple graph G = (V, E), where V is a set of vertices, and E is a set of edges. Chartrand and Lesniak [1] defined that cycle graph is a circuit with no repeated vertices, except the first and last vertices. The cycle graph with n vertices is denoted by C n. They also defined path graph is a walk with no repeated vertices, path graph with n vertices is denoted by P n. Let G 1 and G are two graphs on disjoint sets of n 1 and n vertices, m 1 and m edges, respectively. The edge corona G 1 G is defined as the graph obtained by taking one copy of G 1 and m 1 copies of G, and then joining two end-vertices of the i-th edge of G 1 to every vertex in the i-th copy of G. Note that the edge corona G 1 G of G 1 and G has n 1 + m 1 n vertices and m 1 + m 1 n + m 1 m edges, for detail defnition of graph see [4]. Gallian [] defined a graph labeling as an assignment of integers to the vertices or edges, or both, subject to certain condition. Magic labelings was first introduced in 1963 by Sedláčk [9]. The concept of H-magic graphs was introduced in [3]. An edge-covering of a graph G is a family of different subgraphs H 1, H,..., H k such that each edge of E belongs to at least one of the subgraphs H i, 1 i k. Then, it is said that G admits an (H 1, H,..., H k )- edge covering. If every H i is isomorphic to a given graph H, then we say that G admits an H-covering. Suppose that G = (V (G), E(G)) admits an H-covering. A bijective function f : V (G) E(G) {1,,..., V (G) + E(G) } is an H-magic labeling of G if there exist a positive integer m(f), which we call magic sum such that for each subgraph H = (V (G), E(G) ) of G isomorphic H, f(h ) = v V (G) f(v) + e E(G) f(e) = m(f). In this case we say that the
2 graph G is H-magic. When f(v) = {1,,..., V (G) }, then G is H-supermagic and we denote supermagic-sum is s(f). In [3], they proved that a complete bipartite graph K n,n could be covered by magic star covering K 1,n. Then Lladó and Moragas [5] proved in [3] the same graph containing a cycle cover, they also proved that C 3 -supermagic labelings on a wheel graph W n for n 5 odd and C 4 -supermagic labeling of a prism graph and a book graph. Marbun and Salman [6] then proved that W n -supermagic labelings for a wheel W n k-multilevel corona with a cycle C n. In this paper, we study an H-supermagic labeling of edge corona product of cycle and path graph. We prove that a edge corona product of cycle C n and path P n graph has a P P n - supermagic labeling for n 3.. Main Result A multiset is a set that allows the existence of same elements in it(maryati et al. [7]). Let X be a set containing some positive integers. We use the notation [a, b] to mean {x N a x b} and ΣX to mean x X x. For any k N, the notation k + [a, b] means k + x x [a, b]. According to Guitérrez and Llado [3], the set X is k-equipartion if there exist k subsets of X. say X 1, X,..., X k such that k i=1 X i = X and X i = X k for every i [1, k]..1. k-balanced multiset In this research, we used technique k-balancemultiset that introduced by Maryati et al. [7]. Let Y be a multiset of positive integers and k N. A multiset Y is k-balanced if there are k subsets of Y where Y i = Y 1 = Y =... = Y k then for each i [1, k]. We obtain Y i = Y k, Y i = and k i=1 Y i = Y. Lemma.1 [8] Let x, y, and k be integers, such that 1 x y and k > 1. If X = [x, y] and X is a multiple k, then X is k-balanced. Here, we have several lemmas on k-balanced multiset to build theorem. Lemma. Let k and x be positive integers k 3. Let Y = [1, k] [1, k] [x + 1, x + k], then Y is k-balanced. Proof. For every i [1, k] we define the multisets Y i = {a i, b i, c i } with Then, defined set i + 1 a i = for i [1, k] i + k b i = for i [1, k] c i = x + k + 1 i for i [1, k]. A = {a i 1 i k} = [1, k] B = {b i 1 i k} = [1, k] C = {c i 1 i k} = [x + 1, x + k]. Since A B C = Y and k i=1 Y i = Y, Y i = 3 and Y i = x + 3k+3 for every i [1, k], so we have Y is k-balanced. Lemma.3 Let k and x be positive integers k 3. If Z = [x + 1, x + k ] and Z is k, then Z is k-balanced. Y k N
3 Proof. For every i [1, k] we define the multisets Z i = {a i j 1 j k} where x + i, for i [1, k] and j = 1; a i j = a i j 1 + 1, for j + i = k + ; + x + 1, for i and j others. a i j 1 Since Z i = k; k i=1 Z i = Z and Z i = (x + k ) k+1 for every i [1, k] then Z is k-balanced. Lemma.4 Let x, y and k be positive integers k 4. If W = [1, x] [1, x] [x + 1, x + k] [y + 1, y + k], then W is k-balanced. Proof. For every i [1, k] we define the multisets W i = {a i, b i, c i, d i } with Then, defined set a i = i for i [1, k] { 1 + i, for i [1, k 1]; b i = 1, for i = k; { x + k i, for i [1, k 1]; c i = x + k, for i = k; d i = y + k + 1 i for i [1, k] A = {a i 1 i k} = [1, k] B = {b i 1 i k} = [1, k] C = {c i 1 i k} = [x + 1, x + k] D = {d i 1 i k} = [y + 1, y + k]. Since A B C D = W and k i=1 W i = W, W i = 4 and W i = 5k + for every i [1, k] then W is k-balanced... P P n -Supermagic Labeling on A Cycle Graph Edge Corona with Path C n P n The edge corona product between C n and P n, denoted by C n P n is a graph obtained by taking one copy of C n and E(C n ) copies of P n and then joining two end-vertices of the i-th edge of C n to every vertex in the i-th copy of P n. Figure 1. A Cycle Graph Edge Corona with Path C n P n
4 Theorem.1 Let n be positive integers with n 3. A graph C n P n is P P n -supermagic. Proof. Let G be a C n P n graph for any integer n 3. Then V (G) = n(n+1) and E(G) = 3n. Let A = [1, 4n + n]. We define a bijective function f : V (G) E(G) {1,,..., 4n + n}. Here we have two cases to be considered. Case 1. For n odd. Let V (G) = {v i ; 0 i n} {u i j ; 0 i n, 0 j n} and E(G) = {v 0 v 1, v 1 v,... v n v 0 } {e i j ; 0 i n, 0 j n}. Given a set of labels for all vertices and edges of G denoted by A where A = [1, 4n + n]. Partition A into 3 sets, A = X Y Z, where X = [1, n] [1, n] [n + n + 1, n + n], Y = [n + 1, n + n], and Z = [n + n + 1, 4(n ) + n]. Then we define the total labeling f on G as follows. First, partition X into sets: X 1 = [1, n] and X = [n + n + 1, n + n]. The vertices v i where 0 i n are labeled by set X 1 and edges {v 0 v 1, v 1 v,... v n v 0 } are labeled by set X. According to Lemma., if x = n + n and k = n we have n-balanced. Let X 1 X, then n i=1 X i = X and we have X i = n +5n+3. The vertices u i j where 0 i n and 0 j n are labeled by set Y. Define that u i j are vertices on path. According Lemma.3, if x = n, k = n, and Y = n we have n-balanced where Y i = n3 +n +n. Then, the edges e i j are labeled by set Z where ei j are edges on path and edge on product edge coronation. According Lemma.1, if x = n + n + 1, y = 4n + n, and Z = 3n n we have n-balanced where Y i = 15n3 +4n 1. Case. For n even. Let V (G) = {v i ; 0 i n} {u i ; 0 i n} and E(G) = {e i j ; 0 i n, 0 j n}. Partition A into 3 sets, A = P Q R, where P = [1, n] [1, n] [n+1, n] [n+1, 3n], Q = [3n+1, n +n)], dan R = [n +n+1, 4n +n]. Then we define the total labeling f on G as follows. First, partition P into 3 sets: P 1 = [1, n], P = [n + 1, n], and P 3 = [n + 1, 3n]. The vertices v i where 0 i n are labeled by set P 1, P, and P 3. According to Lemma.4, if x = n and k = n we have n-balanced. Let P 1 P P 3, then n i=1 P i = P and we have P i = 5n+. The vertices u i where 0 i n are labeled by set Q. Define that u i are two vertices in path. According Lemma.1, if x = 3n + 1, y = n + n, and Q = n we have n-balanced where Q i = n + 4n + 1. Then, the edges e i j are labeled by set R where ei j are edges on graph G. According Lemma.1, if x = n + n + 1, y = 4n + n, and R = 3n we have n-balanced where R i = 15n3 +6n +3n. Furthermore, the constant supermagic sum of a subgraph P P n are as follows f(p P n ) = { 8n 3 + 4n + 3n + 1, for n odd; 15n 3 +8n +1n+6, for n even. Figure illustrates an example of P P 3 -supermagic labeling on C 3 P 3 graph.
5 Figure. A P P 3 -supermagic labeling on C 3 P 3 graph 3. Conclusion In this paper we have shown the P P n -supermagic labeling of edge corona product of cycle and path graph. Open Problem: For further research we can studied P P n -supermagic labeling on C n P m with n 3 and m. Acknowledgments We gratefully ackowledge the support from Mathematics Department of Mathematics and Natural Sciences Faculty, Universitas Sebelas Maret. References [1] Chartrand, G. and L. Lesniak, Graphs and Digraphs, nd ed., Wadsworth Inc., California, [] Gallian, J.A., A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics 19 (016), #DS6. [3] Guitérrez and A. Lladó, Magic Coverings, J. Combin. Math. Combin. Computing 55 (005), [4] Hou, Y. and Shiu W, The Spectrum of The Edge Corona of Two Graphs, Electronic Journal of Linear Algebra 0 (010), [5] Lladó, A. and J. Moragas, Cycle-magic Graphs, Discrete Mathematics 307 (008), [6] Marbun, H. T. and A. N. M. Salman, wheel-supermagic Labelings for A Wheel k-multilevel Corona With A Cycle, J. Graphs Cpmb. 10 (013), [7] Maryati, T. K., A. N. M. Salman, E. T. Baskoro, J. Ryan, and M. Miller, On H-supermagic Labelings for Certain Shackles and Amalgamations of a Connected Graph, Utilitas Mathematica 83 (010), [8] Maryati, T. K., E. T. Baskoro, and A. N. M. Salman, P h -supermagic Labelings of Some Trees, J. Combin. Math. Combin. Computing 65 (008), [9] Sedláčk, J., Theory of Graphs and Its Applications, House Czechoslovak Sci. Prague (1964),
arxiv: v2 [cs.dm] 27 Jun 2017
H-SUPERMAGIC LABELINGS FOR FIRECRACKERS, BANANA TREES AND FLOWERS RACHEL WULAN NIRMALASARI WIJAYA 1, ANDREA SEMANIČOVÁ-FEŇOVČÍKOVÁ, JOE RYAN 1, AND THOMAS KALINOWSKI 1 arxiv:1607.07911v [cs.dm] 7 Jun 017
More informationH-E-Super magic decomposition of graphs
Electronic Journal of Graph Theory and Applications () (014), 115 18 H-E-Super magic decomposition of graphs S. P. Subbiah a, J. Pandimadevi b a Department of Mathematics Mannar Thirumalai Naicker College
More informationThe Connected and Disjoint Union of Semi Jahangir Graphs Admit a Cycle-Super (a, d)- Atimagic Total Labeling
Journal of Physics: Conference Series PAPER OPEN ACCESS The Connected and Disjoint Union of Semi Jahangir Graphs Admit a Cycle-Super (a, d)- Atimagic Total Labeling Related content - On The Partition Dimension
More informationMixed cycle-e-super magic decomposition of complete bipartite graphs
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir Mixed cycle-e-super magic decomposition of complete bipartite graphs G. Marimuthu, 1 and S. Stalin Kumar 2 1 Department of Mathematics,
More informationOF STAR RELATED GRAPHS
Discussiones Mathematicae Graph Theory 35 (015) 755 764 doi:10.7151/dmgt.183 ON SUPER (a, d)-h-antimagic TOTAL COVERING OF STAR RELATED GRAPHS KM. Kathiresan Centre for Research and Post Graduate Studies
More informationarxiv: v1 [math.co] 23 Apr 2015
On cycle-supermagic labelings of the disconnected graphs Syed Tahir Raza Rizvi, Kashif Ali arxiv:1506.06087v1 [math.co] 3 Apr 015 Graphs and Combinatorics Research Group, Department of Mathematical Sciences,
More informationarxiv: v2 [math.co] 26 Apr 2014
Super edge-magic deficiency of join-product graphs arxiv:1401.45v [math.co] 6 Apr 014 A.A.G. Ngurah 1 Department of Civil Engineering Universitas Merdeka Malang Jalan Taman Agung No. 1 Malang, Indonesia
More informationSuper edge-magic labeling of graphs: deficiency and maximality
Electronic Journal of Graph Theory and Applications 5 () (017), 1 0 Super edge-magic labeling of graphs: deficiency and maximality Anak Agung Gede Ngurah a, Rinovia Simanjuntak b a Department of Civil
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationOn Super Edge-magic Total Labeling of Modified Watermill Graph
Journal of Physics: Conference Series PAPER OPEN ACCESS On Super Edge-magic Total Labeling of Modified Watermill Graph To cite this article: Nurdin et al 018 J. Phys.: Conf. Ser. 979 01067 View the article
More informationDifference Cordial Labeling of Graphs Obtained from Double Snakes
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 3 (013), pp. 317-3 International Research Publication House http://www.irphouse.com Difference Cordial Labeling of Graphs
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
More informationSome Edge-magic Cubic Graphs
Some Edge-magic Cubic Graphs W. C. Shiu Department of Mathematics Hong Kong Baptist University 4 Waterloo Road, Kowloon Tong Hong Kong, China. and Sin-Min Lee Department of Mathematics and Computer Science
More informationSQUARE DIFFERENCE 3-EQUITABLE LABELING FOR SOME GRAPHS. Sattur , TN, India. Sattur , TN, India.
International Journal of Science, Engineering Technology Research (IJSETR), Volume 5, Issue, March 2016 SQUARE DIFFERENCE -EQUITABLE LABELING FOR SOME GRAPHS R Loheswari 1 S Saravana kumar 2 1 Research
More informationMagic Graphoidal on Class of Trees A. Nellai Murugan
Bulletin of Mathematical Sciences and Applications Online: 2014-08-04 ISSN: 2278-9634, Vol. 9, pp 33-44 doi:10.18052/www.scipress.com/bmsa.9.33 2014 SciPress Ltd., Switzerland Magic Graphoidal on Class
More informationNew Constructions of Antimagic Graph Labeling
New Constructions of Antimagic Graph Labeling Tao-Ming Wang and Cheng-Chih Hsiao Department of Mathematics Tunghai University, Taichung, Taiwan wang@thu.edu.tw Abstract An anti-magic labeling of a finite
More informationFurther Studies on the Sparing Number of Graphs
Further Studies on the Sparing Number of Graphs N K Sudev 1, and K A Germina 1 Department of Mathematics arxiv:1408.3074v1 [math.co] 13 Aug 014 Vidya Academy of Science & Technology Thalakkottukara, Thrissur
More informationCombinatorial Labelings Of Graphs
Applied Mathematics E-Notes, 6(006), 51-58 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Combinatorial Labelings Of Graphs Suresh Manjanath Hegde, Sudhakar Shetty
More informationSUPERMAGIC GENERALIZED DOUBLE GRAPHS 1
Discussiones Mathematicae Graph Theory 36 (2016) 211 225 doi:10.7151/dmgt.1849 SUPERMAGIC GENERALIZED DOUBLE GRAPHS 1 Jaroslav Ivančo Institute of Mathematics, P.J. Šafárik University Jesenná 5, 040 01
More informationThe metric dimension of regular bipartite graphs
Bull. Math. Soc. Sci. Math. Roumanie Tome 54(10) No. 1, 011, 15 8 The metric dimension of regular bipartite graphs by M. Bača, E.T. Baskoro, A.N.M. Salman, S.W. Saputro, D. Suprijanto Abstract A set of
More informationOn the super edge-magic deficiency of some families related to ladder graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 51 (011), Pages 01 08 On the super edge-magic deficiency of some families related to ladder graphs Ali Ahmad Department of Mathematics GC University Lahore
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationOn (a, d)-vertex-antimagic total labeling of Harary graphs
On (a, d)-ertex-antimagic total labeling of Harary graphs M. Hussain 1, Kashif Ali 1, M. T. Rahim, Edy Tri Baskoro 3 1 COMSATS Institute of Information Technology, Lahore Campus, Pakistan {muhammad.hussain,kashif.ali}@ciitlahore.edu.pk
More informationOn the ascending subgraph decomposition problem for bipartite graphs
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 46 (2014) 19 26 www.elsevier.com/locate/endm On the ascending subgraph decomposition problem for bipartite graphs J. M.
More informationOn (Super) Edge-Magic Total Labeling of Subdivision of K 1,3
SUT Journal of Mathematics Vol. 43, No. (007), 17 136 On (Super) Edge-Magic Total Labeling of Subdivision of K 1,3 Anak Agung Gede Ngurah, Rinovia Simanjuntak and Edy Tri Baskoro (Received August 31, 006)
More informationOdd Sum Labeling of Tree Related Graphs
International Journal of Mathematics And its Applications Volume 4, Issue 4 (016), 11 16. ISSN: 347-1557 Available Online: http://ijmaa.in/ International Journal 347-1557 of Mathematics Applications And
More informationOdd-even sum labeling of some graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (017), 57-63. ISSN Print : 49-338 Odd-even sum labeling of some graphs ISSN Online : 319-515 K. Monika 1, K. Murugan 1 Department of
More informationOn star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
More informationOn cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components
On cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components R. C. Bunge 1, S. I. El-Zanati 1, D. Gibson 2, U. Jongthawonwuth 3, J. Nagel 4, B. Stanley 5, A. Zale 1 1 Department
More informationTHE LOCATING-CHROMATIC NUMBER OF DISCONNECTED GRAPHS
Far East Journal of Mathematical Sciences (FJMS) 2014 Pushpa Publishing House, Allahabad, India Published Online: December 2014 Available online at http://pphmj.com/journals/fjms.htm Volume 94, Number
More informationd 2 -coloring of a Graph
d -coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India E-mail: selva 158@yahoo.co.in Abstract A subset S of
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationCO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 011, 3 36 CO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH K. NAGARAJAN and A. NAGARAJAN Abstract A decomposition of a graph G is a collection ψ of edge-disjoint
More informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
More informationFans are cycle-antimagic
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(1 (017, Pages 94 105 Fas are cycle-atimagic Ali Ovais Muhammad Awais Umar Abdus Salam School of Mathematical Scieces GC Uiversity, Lahore Pakista aligureja
More informationSOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS. Sattur , TN, India.
SOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS A.Raja Rajeswari 1 and S.Saravana Kumar 1 Research Scholar, Department of Mathematics, Sri S.R.N.M.College, Sattur-66 03, TN, India. Department
More informationAKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS
Reprinted from AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS AKCE Int. J. Graphs Comb., 10, No. 3 (2013), pp. 317-325 The partition dimension for a subdivision of homogeneous caterpillars Amrullah,
More informationk-difference cordial labeling of graphs
International J.Math. Combin. Vol.(016), 11-11 k-difference cordial labeling of graphs R.Ponraj 1, M.Maria Adaickalam and R.Kala 1.Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-6741,
More informationApproximate results for rainbow labelings
Periodica Mathematica Hungarica manuscript No. (will be inserted by the editor) Approximate results for rainbow labelings Anna Lladó Mirka Miller Received: date / Accepted: date Abstract A simple graph
More informationOn zero sum-partition of Abelian groups into three sets and group distance magic labeling
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 13 (2017) 417 425 On zero sum-partition of Abelian groups into three
More informationNote on group distance magic complete bipartite graphs
Cent. Eur. J. Math. 12(3) 2014 529-533 DOI: 10.2478/s11533-013-0356-z Central European Journal of Mathematics Note on group distance magic complete bipartite graphs Research Article Sylwia Cichacz 1 1
More informationOn Extremal Value Problems and Friendly Index Sets of Maximal Outerplanar Graphs
Australian Journal of Basic and Applied Sciences, 5(9): 2042-2052, 2011 ISSN 1991-8178 On Extremal Value Problems and Friendly Index Sets of Maximal Outerplanar Graphs 1 Gee-Choon Lau, 2 Sin-Min Lee, 3
More informationOne Modulo Three Harmonic Mean Labeling of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 4 (20), pp. 4-422 International Research Publication House http://www.irphouse.com One Modulo Three Harmonic Mean Labeling
More informationFurther Results on Square Sum Graph
International Mathematical Forum, Vol. 8, 2013, no. 1, 47-57 Further Results on Square Sum Graph K. A. Germina School of Mathematical and Physical Sciences Central University of Kerala, Kasaragode, India
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Varaporn Saenpholphat; Ping Zhang Connected resolvability of graphs Czechoslovak Mathematical Journal, Vol. 53 (2003), No. 4, 827 840 Persistent URL: http://dml.cz/dmlcz/127843
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More information0-Sum and 1-Sum Flows in Regular Graphs
0-Sum and 1-Sum Flows in Regular Graphs S. Akbari Department of Mathematical Sciences Sharif University of Technology Tehran, Iran School of Mathematics, Institute for Research in Fundamental Sciences
More informationGraceful Related Labeling and its Applications
International Journal of Mathematics Research (IJMR). ISSN 0976-5840 Volume 7, Number 1 (015), pp. 47 54 International Research Publication House http://www.irphouse.com Graceful Related Labeling and its
More informationA Creative Review on Integer Additive Set-Valued Graphs
A Creative Review on Integer Additive Set-Valued Graphs N. K. Sudev arxiv:1407.7208v2 [math.co] 30 Jan 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationThe Nordhaus-Gaddum problem for the k-defective chromatic number of a P 4 -free graph
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (2011), Pages 3 13 The Nordhaus-Gaddum problem for the k-defective chromatic number of a P 4 -free graph Nirmala Achuthan N. R. Achuthan Department of Mathematics
More informationThe chromatic covering number of a graph
The chromatic covering number of a graph Reza Naserasr a Claude Tardif b May 7, 005 a: Department of Mathematics, Simon Fraser University, Burnaby BC, V5A 1S6, Canada. Current address: Department of Combinatorics
More informationComputer Engineering Department, Ege University 35100, Bornova Izmir, Turkey
Selçuk J. Appl. Math. Vol. 10. No. 1. pp. 107-10, 009 Selçuk Journal of Applied Mathematics Computing the Tenacity of Some Graphs Vecdi Aytaç Computer Engineering Department, Ege University 35100, Bornova
More informationDistance labelings: a generalization of Langford sequences
Also available at http://amc-journal.eu ISSN -9 (printed edn.), ISSN -9 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA (0) Distance labelings: a generalization of Langford sequences S. C. López Departament
More information1.4 Equivalence Relations and Partitions
24 CHAPTER 1. REVIEW 1.4 Equivalence Relations and Partitions 1.4.1 Equivalence Relations Definition 1.4.1 (Relation) A binary relation or a relation on a set S is a set R of ordered pairs. This is a very
More informationarxiv: v1 [math.co] 4 Jan 2018
A family of multigraphs with large palette index arxiv:80.0336v [math.co] 4 Jan 208 M.Avesani, A.Bonisoli, G.Mazzuoccolo July 22, 208 Abstract Given a proper edge-coloring of a loopless multigraph, the
More informationSuper Mean Labeling of Some Classes of Graphs
International J.Math. Combin. Vol.1(01), 83-91 Super Mean Labeling of Some Classes of Graphs P.Jeyanthi Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur-68 15, Tamil Nadu,
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationOn cordial labeling of hypertrees
On cordial labeling of hypertrees Michał Tuczyński, Przemysław Wenus, and Krzysztof Węsek Warsaw University of Technology, Poland arxiv:1711.06294v3 [math.co] 17 Dec 2018 December 19, 2018 Abstract Let
More informationBigraph-factorization of symmetric complete bipartite multi-digraphs
Bigraph-factorization of symmetric complete bipartite multi-digraphs Kazuhiko U shio Department of Industrial Engineering Faculty of Science and Technology Kinki University, Osaka 577-8502, JAPAN E-mail:ushio@is.kindai.ac.jp
More informationINDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in
More informationOn (k, d)-multiplicatively indexable graphs
Chapter 3 On (k, d)-multiplicatively indexable graphs A (p, q)-graph G is said to be a (k,d)-multiplicatively indexable graph if there exist an injection f : V (G) N such that the induced function f :
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationIrredundance saturation number of a graph
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 46 (2010), Pages 37 49 Irredundance saturation number of a graph S. Arumugam Core Group Research Facility (CGRF) National Center for Advanced Research in Discrete
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationOn the Ramsey number of 4-cycle versus wheel
Indonesian Journal of Combinatorics 1 (1) (2016), 9 21 On the Ramsey number of 4-cycle versus wheel Enik Noviani, Edy Tri Baskoro Combinatorial Mathematics Research Group Faculty of Mathematics and Natural
More informationC-Perfect K-Uniform Hypergraphs
C-Perfect K-Uniform Hypergraphs Changiz Eslahchi and Arash Rafiey Department of Mathematics Shahid Beheshty University Tehran, Iran ch-eslahchi@cc.sbu.ac.ir rafiey-ar@ipm.ir Abstract In this paper we define
More informationTHE DECK RATIO AND SELF-REPAIRING GRAPHS
THE DECK RATIO AND SELF-REPAIRING GRAPHS YULIA BUGAEV AND FELIX GOLDBERG Abstract. In this paper we define, for a graph invariant ψ, the ψ(g) deck ratio of ψ by D ψ (G) = P ψ(g v). We give generic upper
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationON SET-INDEXERS OF GRAPHS
Palestine Journal of Mathematics Vol. 3(2) (2014), 273 280 Palestine Polytechnic University-PPU 2014 ON SET-INDEXERS OF GRAPHS Ullas Thomas and Sunil C Mathew Communicated by Ayman Badawi MSC 2010 Classification:
More informationA survey of face-antimagic evaluations of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(3) (2017), Pages 382 393 A survey of face-antimagic evaluations of graphs Martin Bača 1 Edy T. Baskoro 2 Ljiljana Brankovic 3 Stanislav Jendrol 4 Yuqing
More informationRamsey Unsaturated and Saturated Graphs
Ramsey Unsaturated and Saturated Graphs P Balister J Lehel RH Schelp March 20, 2005 Abstract A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number,
More informationCycle decompositions of the complete graph
Cycle decompositions of the complete graph A.J.W. Hilton Department of Mathematics University of Reading Whiteknights P.O. Box 220 Reading RG6 6AX U.K. Matthew Johnson Department of Mathematics London
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationINTEGER-MAGIC SPECTRA OF AMALGAMATIONS OF STARS AND CYCLES. Sin-Min Lee San Jose State University San Jose, CA
INTEGER-MAGIC SPECTRA OF AMALGAMATIONS OF STARS AND CYCLES Sin-Min Lee San Jose State Universit San Jose, CA 9592 lee@cs.sjsu.edu Ebrahim Salehi Department of Mathematical Sciences Universit of Nevada
More informationThe Exquisite Integer Additive Set-Labeling of Graphs
The Exquisite Integer Additive Set-Labeling of Graphs N. K. Sudev 1, K. A. Germina 2 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501, Kerala, India.
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationRelating minimum degree and the existence of a k-factor
Relating minimum degree and the existence of a k-factor Stephen G Hartke, Ryan Martin, and Tyler Seacrest October 6, 010 Abstract A k-factor in a graph G is a spanning regular subgraph in which every vertex
More informationLocating Chromatic Number of Banana Tree
International Mathematical Forum, Vol. 12, 2017, no. 1, 39-45 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.610138 Locating Chromatic Number of Banana Tree Asmiati Department of Mathematics
More informationarxiv: v1 [math.co] 29 Jul 2010
RADIO NUMBERS FOR GENERALIZED PRISM GRAPHS PAUL MARTINEZ, JUAN ORTIZ, MAGGY TOMOVA, AND CINDY WYELS arxiv:1007.5346v1 [math.co] 29 Jul 2010 Abstract. A radio labeling is an assignment c : V (G) N such
More informationCOUNTING AND ENUMERATING SPANNING TREES IN (di-) GRAPHS
COUNTING AND ENUMERATING SPANNING TREES IN (di-) GRAPHS Xuerong Yong Version of Feb 5, 9 pm, 06: New York Time 1 1 Introduction A directed graph (digraph) D is a pair (V, E): V is the vertex set of D,
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationPyramidal Sum Labeling In Graphs
ISSN : 48-96, Vol 8, Issue 4, ( Part -I) April 8, pp-9 RESEARCH ARTICLE Pyramidal Sum Labeling In Graphs OPEN ACCESS HVelet Getzimah, D S T Ramesh ( department Of Mathematics, Pope s College, Sayerpuram-68,Ms
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationNear a-labelings of bipartite graphs*
Near a-labelings of bipartite graphs* S. I. EI-Zanati, M. J. Kenig and C. Vanden Eynden 4520 Mathematics Department Illinois State Univ:ersity Normal, Illinois 61790-4520, U.S.A. Abstract An a-labeling
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More informationA Study on Integer Additive Set-Graceful Graphs
A Study on Integer Additive Set-Graceful Graphs N. K. Sudev arxiv:1403.3984v3 [math.co] 27 Sep 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur, India. E-mail:
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
More informationSTUDIES IN GRAPH THEORY - DISTANCE RELATED CONCEPTS IN GRAPHS. R. ANANTHA KUMAR (Reg. No ) DOCTOR OF PHILOSOPHY
STUDIES IN GRAPH THEORY - DISTANCE RELATED CONCEPTS IN GRAPHS A THESIS Submitted by R. ANANTHA KUMAR (Reg. No. 200813107) In partial fulfillment for the award of the degree of DOCTOR OF PHILOSOPHY FACULTY
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of Graph-Paths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281-288 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Orthogonal
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
More informationON HAMILTON CIRCUITS IN CAYLEY DIGRAPHS OVER GENERALIZED DIHEDRAL GROUPS
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 53, No. 2, 2012, 79 87 ON HAMILTON CIRCUITS IN CAYLEY DIGRAPHS OVER GENERALIZED DIHEDRAL GROUPS ADRIÁN PASTINE AND DANIEL JAUME Abstract. In this paper we
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationIndependence in Function Graphs
Independence in Function Graphs Ralucca Gera 1, Craig E. Larson 2, Ryan Pepper 3, and Craig Rasmussen 1 1 Naval Postgraduate School, Department of Applied Mathematics, Monterey, CA 93943; rgera@nps.edu,
More informationDepartment of Mathematics, Sri Krishna Institute of Technology, Bengaluru , Karnataka, India. *Correspondence author s
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (017), pp. 6393-6406 Research India Publications http://www.ripublication.com ON SUPER (a, d)-anti-edgemagic OF C m ok
More informationGraceful polynomials of small degree
Graceful polynomials of small degree Andrea Vietri 1 1 Dipartimento di Scienze di Base e Applicate per l Ingegneria Sapienza Università di Roma WAGTCN2018, Naples, 13-14 September 2018 Andrea Vietri 1
More information