Chapter 4. Triangular Sum Labeling
|
|
- Ernest Thompson
- 6 years ago
- Views:
Transcription
1 Chapter 4 Triangular Sum Labeling 32
2 Chapter 4. Triangular Sum Graphs Introduction This chapter is focused on triangular sum labeling of graphs. As every graph is not a triangular sum graph it is very interesting to investigate graphs or graph families which are not triangular sum graphs. Here we investigate some of the graphs which are not triangular sum graphs. 4.2 Triangular Sum Graphs Definition A triangular number is a number obtained by adding all positive integers less than or equal to a given positive integer n. If n th triangular number is denoted by T n then T n = 1 n(n + 1). It is easy to observe that there does not exist consecutive 2 integers which are triangular numbers. The first few triangular numbers are 1, 3, 6, 10, 15, 21, 28, 36, 45, 55. Definition A function f is called a triangular sum labeling of a graph G if f : V (G) N ( where N is the set of all non-negative integers) is injective and the induced function f + : E(G) {T 1,T 2,...,T p } defined as f + (uv) = f (u)+ f (v) for every edge e having end vertices is bijective. A graph which admits triangular sum labeling is called a triangular sum graph. The notion of triangular sum labeling was originated by Hegde and Shankaran [27]. Illustration A triangular sum labeling of P 7 is shown in the Figure 4.1. FIGURE 4.1: P 7 and its triangular sum labeling
3 Chapter 4. Triangular Sum Graphs Some Existing Results on Triangular Sum Graphs Hegde and Shankaran [27] have proved that path P n is a triangular sum graph. star K 1,n is a triangular sum graph. any tree obtained from the star K 1,n by replacing each edge by a path is a triangular sum graph. the lobster T obtained by joining the centers of k copies of a stat to a new vertex w is a triangular sum graph. the complete n-ary tree T m of level m is a triangular sum graph. the complete graph K n is triangular sum if and only if n 2. if G is an Eulerian (p,q)-graph admitting a triangular sum labeling then q 1(mod 12). the Dutch windmill DW(n) ( n copies of K 3 sharing a common vertex) is not a triangular sum graph. the complete graph K 4 can be embedded as an induced subgraph of a triangular sum graph. if G is a unicyclic graph consisting of a unique triangle (v 1,v 2,v 3,v 1 ) with deg(v 2 ) = deg(v 2 ) = 3, a path P = v 1,u 1,u 2,...,u n of length n and k pendant vertices w 1,w 2,...,w k adjacent to v 1 then G is a triangular sum graph for all n 3. Hegde and Shankaran [27] have conjectured that The complete graph K n, n 5 is a forbidden subgraph for a triangular sum graph. Vaidya et al [71] have proved that every cycle can be embedded as an induced subgraph of a triangular sum graph. every cycle with one chord can be embedded as an induced subgraph of a triangular sum graph.
4 Chapter 4. Triangular Sum Graphs 35 every cycle with twin chords can be embedded as an induced subgraph of a triangular sum graph. Seoud and Salim [49] have proved that every tree can be embedded as a triangular sum graph. P n1 P n2, for any n 1 > 4 and for any n 2 is a triangular sum graph. P n, for n 5 is a triangular sum graph. the graph which is constructed by attaching the roots of different stars to one vertex, is a triangular sum graph. the tree which is obtained by identifying the roots of n stars: K 1,t1, K 1,,t2,..., K 1,tn with the n vertices of a path P n, is a triangular sum graph. the graph P n K m is a triangular sum graph. every symmetrical tree is a triangular sum graph. all the trees of order 9 are triangular sum graphs. the arbitrary union of C 4 can be embedded as an induced subgraph of a triangular sum graph. the one-point union of m cycles of length 4 can be embedded as an induced subgraph of a triangular sum graph. Seoud and Salim [49] have shown a construction to generate many triangular sum trees from a triangular sum tree of order p by joining vertices to every vertex of a label less than p. Murugesan et al [44] have defined second and third order triangular sum labeling. Murugesan et al [44] have proved that the path P n admits second order triangular sum labeling. the star graph K 1,n admits second order triangular sum labeling. coconut trees admit second order triangular sum labeling. the bistar B m,n admits second order triangular sum labeling.
5 Chapter 4. Triangular Sum Graphs 36 the graph B m,n,k (a graph obtained from a path of length k by attaching the stars K 1,m and K 1,n with its pendent vertices) admits second order triangular sum labeling. the path P n admits third order triangular sum labeling. the star graph K 1,n admits third order triangular sum labeling. coconut trees admit third order triangular sum labeling. the bistar B m,n admits third order triangular sum labeling. the graph B m,n,k admits third order triangular sum labeling 4.4 Some New Results on Triangular Sum Labeling In the present work we investigate some classes of graphs which does not admit a triangular sum labeling. Lemma In every triangular sum graph G the vertices with labels 0 and 1 are always adjacent. Proof. The edge label T 1 = 1 is possible only when the vertices with label 0 and 1 are adjacent. Lemma In any triangular sum graph G, 0 and 1 cannot be the labels of vertices of the same triangle contained in G. Proof. Let a 0,a 1, and a 2 be the vertices of a triangle. If a 0 and a 1 are labeled with 0 and 1 respectively and a 2 is labeled with some x N, where x 0, x 1. Such vertex labeling will give rise to edge labels with 1,x, and x + 1. In order to admit a triangular sum labeling, x and x + 1 must be triangular numbers. But it is not possible as we mentioned in Definition Lemma In any triangular sum graph G, 1 and 2 cannot be the labels of vertices of the same triangle contained in G.
6 Chapter 4. Triangular Sum Graphs 37 Proof. Let a 0,a 1,a 2 be the vertices of a triangle. Let a 0 and a 1 are labeled with 1 and 2 respectively and a 2 is labeled with some x N, where x 1,x 2. Such vertex labeling will give rise to edge labels 3,x + 1, and x + 2. In order to admit a triangular sum labeling, x + 1 and x + 2 must be triangular numbers. Which is not possible due to the fact mentioned in Definition Theorem The Helm graph H n is not a triangular sum graphs. Proof. Let us denote the apex vertex as c 1, the consecutive vertices adjacent to c 1 as v 1,v 2,...,v n, and the pendant vertices adjacent to v 1,v 2,...,v n as u 1,u 2,...,u n respectively. If possible H n admits a triangular sum labeling f : V N, then we consider following cases: Case 1: f (c 1 ) = 0. Then according to Lemma 4.4.1, we have to assign label 1 to exactly one of the vertex from v 1,v 2,...,v n. Then there is a triangle having the vertices with labels 0 and 1 as adjacent vertices, which contradicts the Lemma Case 2: Any one of the vertex from v 1,v 2,...,v n is labeled with 0. Without loss of generality let us assume that f (v 1 ) = 0. Then one of the vertex from c 1,v 2,v n,u 1 must be labeled with 1. Note that each of the vertex from c 1,v 2,v n,u 1 is adjacent to v 1. Subcase 1: If one of the vertex from c 1,v 2,v n is labeled with 1. In each of the possibilities, there is a triangle having two of the vertices with labels 0 and 1, which contradicts the Lemma Subcase 2: If f (u 1 ) = 1 then the edge label T 2 = 3 can be obtained by vertex labels 0, 3 or 1, 2. The vertex with label 1 and the vertex with label 2 cannot be adjacent as u 1 is a pendant vertex having label 1 and it is adjacent to the vertex with label 0. Therefore one of the vertex from v 2,v n,c 1 must receive the label 3. Thus there is a triangle whose two of the vertices are labeled with 0 and 3. Let the third vertex be labeled with x, with x 0 and x 3. To admit a triangular sum labeling 3,x,x + 3 must be distinct triangular numbers. i.e. x and x + 3 are two distinct triangular numbers other than 3 having difference 3, which is not possible.
7 Chapter 4. Triangular Sum Graphs 38 Case 3: Any one of the vertex from u 1,u 2,...,u n is labeled with 0. Without loss of generality we may assume that f (u 1 ) = 0. Then according to Lemma 4.4.1, f (v 1 ) = 1. The edge labels T 2 = 3 can be obtained by vertex labels 0, 3 or 1, 2. The vertex with label 0 and the vertex with label 3 cannot be the adjacent vertices as u 1 is a pendant vertex having label 0 and it is adjacent to the vertex with label 1. Therefore one of the vertices from v 2,v n,c 1 must be labeled with 2. Thus we have a triangle having the vertices with labels 1 and 2 which contradicts the Lemma Thus in each of the possibilities discussed above H n does not admits a triangular sum labeling. Theorem If every edge of a graph G is an edge of a triangle then G is not a triangular sum graph. Proof. If G admits a triangular sum labeling then according to Lemma there exists two adjacent vertices having labels 0 and 1 respectively. So there is a triangle having two of the vertices labeled with 0 and 1, which contradicts Lemma Thus G does not admit a triangular sum labeling. Following are the immediate corollaries of the previous result. Corollary The wheel graph W n is not a triangular sum graph. Corollary The fan graph f n = P n 1 + K 1 is not a triangular sum graph. Corollary The friendship graph F n = nk 3 is not a triangular sum graph. Corollary The graph g n (the graph obtained by joining all the vertices of P n to two additional vertices) is not a triangular sum graph. Corollary The flower graph (the graph obtained by joining all the pendant vertices of helm graph H n with the apex vertex) is not a triangular sum graph. Corollary The graph obtained by joining apex vertices of two wheels and respective apex vertices with a new vertex is not a triangular sum graph. Theorem The graph < W n : W m > is not a triangular sum graphs.
8 Chapter 4. Triangular Sum Graphs 39 Proof. Let G =< W n : W m >. Let us denote the apex vertex of W n by u 0 and the vertices adjacent to u 0 of the wheel W n by u 1,u 2,...,u n. Similarly denote the apex vertex of other wheel W m by v 0 and the vertices adjacent to v 0 of the wheel W m by v 1,v 2,...,v m. Let w be the new vertex adjacent to apex vertices of both the wheels. If possible let f :V N be one of the possible triangular sum labeling. According to Lemma 4.4.1, 0 and 1 are the labels of some two adjacent vertices of the graph G, we have the following cases: Case 1: If 0 and 1 be the labels of adjacent vertices in W n or W m, then there is a triangle having two of the vertices labeled with 0 and 1. Which contradicts the Lemma Case 2: If f (w) = 0 then according to Lemma one of the vertex from u 0 and v 0 is labeled with 1. Without loss of generality we may assume that f (u 0 ) = 1. To have an edge label T 2 = 3 we have the following possibilities: Subcase 2.1: One of the vertices from u 1,u 2,...,u n is labeled with 2. Without loss of generality assume that f (u i ) = 2, for some i {1,2,3,...,n}. In this situation we will get a triangle having two of its vertices are labeled with 1 and 2, which contradicts the Lemma Subcase 2.2: Assume that f (v 0 ) = 3. Now to get the edge label T 3 = 6 we have the following subcases: Subcase 2.2.1: Assume that f (u i ) = 5, for some i {1,2,3,...,n}. In this situation we will get a triangle with distinct vertex labels 1,5 and x. Then x + 5 and x + 1 will be the edge labels of two edges with difference 4. It is possible only if x = 5, but x 5 as we have f (u i ) = 5. Subcase 2.2.2: Assume that 2 and 4 are the labels of two adjacent vertices from one of the two wheels. So there exists a triangle whose vertex labels are either 1,2, and 4 or 3,2, and 4. In either of the situation will give rise to an edge label 5 which is not a triangular number. Case 3: If f (w) = 1 then one of the vertices from u 0 and v 0 is labeled with 0. Without loss of generality assume that f (u 0 ) = 0. To have an edge label 3 we have the following possibilities:
9 Chapter 4. Triangular Sum Graphs 40 Subcase 3.1: If f (u i ) = 3 for some i {1,2,3,...,n}. Then there is a triangle having vertex labels as 0,3,x, with x 3. Thus we have two edge labels x + 3 and x which are two distinct triangular numbers having difference 3. So x = 3, which is not possible as x 3. Subcase 3.2: Assume that f (v 0 ) = 2. Now to obtain the edge label T 3 = 6 we have to consider the following possibilities: (i) 6=6+0; (ii) 6=5+1; (iii) 6=4+2. (i) If 6 = then one of the vertices from u 1,u 2,...,u n must be labeled with 6. Without loss of generality we may assume that f (u i ) = 6 for some i {1,2,3,...,n}. In this situation there are two distinct triangles having vertex labels 0,6,x and 0,6,y, for two distinct triangular numbers x and y each of which are different from 0 and 6. Then x+6 and x are two distinct triangular numbers having difference 6. This is possible only for x = 15. On the other hand y + 6 and y are two distinct triangular numbers having difference 6. Then y = 15. ( The x = y = 15 which is not possible as f is one-one) (ii) If 6 = and f (w) = 1, then in this situation label of one of the vertex adjacent to w must be 5. This is not possible as w adjacent to the vertices whose labels are 0 and 2. (iii) If 6 = In this case one of the vertices from v 1,v 2,...,v m is labeled with 4. Assume that f (v i ) = 4, for some i {1,2,3,...,m}. In this situation there is a triangle having vertex labels 2,4 and x (where x is a positive integer with x 2,x 4.) Then 4 + x and 2 + x will be the edge labels of two edges i.e. 4 + x and 2 + x are two distinct triangular numbers with difference 2 which is not possible. Thus we conclude that in each of the possibilities discussed above the graph G under consideration does not admit a triangular sum labeling.
10 Chapter 4. Triangular Sum Graphs Scope of Further Research To investigate triangular sum labeling for the graph obtained from some graph operations on a given graph. To investigate forbidden subgraphs characterization for the triangular sum labeling. To investigate graphs or graph families which admit triangular sum labeling. 4.6 Concluding Remarks We have investigated some graphs which are not triangular sum graphs. This work is a nice combination of graph theory and combinatorial number theory. The next chapter is aimed to discuss prime labeling of graphs.
Chapter 5. Fibonacci Graceful Labeling of Some Graphs
Chapter 5 ibonacci Graceful Labeling of Some Graphs 12 Chapter 5. ibonacci and Super ibonacci Graceful Labeling of Some Graphs 13 5.1 Introduction The brief account of graceful labeling is given in chapter
More informationMean, Odd Sequential and Triangular Sum Graphs
Circulation in Computer Science Vol.2, No.4, pp: (40-52), May 2017 https://doi.org/10.22632/ccs-2017-252-08 Mean, Odd Sequential and Triangular Sum Graphs M. A. Seoud Department of Mathematics, Faculty
More informationChapter 4. square sum graphs. 4.1 Introduction
Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations
More informationProduct Cordial Labeling for Some New Graphs
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 3, No. ; May 011 Product Cordial Labeling for Some New Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University
More informationMore on Permutation Labeling of Graphs
International Journal of Applied Graph Theory Vol.1, No. (017), 30-4. ISSN(Online) : 456 7884 More on Permutation Labeling of Graphs G. V. Ghodasara Department of Mathematics H. & H. B. Kotak Institute
More informationarxiv: v1 [math.co] 5 Jan 2018
Neighborhood-Prime Labelings of Trees and Other Classes of Graphs Malori Cloys Austin Peay State University mcloys@my.apsu.edu arxiv:1801.0180v1 [math.co] 5 Jan 018 N. Bradley Fox Austin Peay State University
More informationAMO - Advanced Modeling and Optimization, Volume 16, Number 2, 2014 PRODUCT CORDIAL LABELING FOR SOME BISTAR RELATED GRAPHS
AMO - Advanced Modeling and Optimization, Volume 6, Number, 4 PRODUCT CORDIAL LABELING FOR SOME BISTAR RELATED GRAPHS S K Vaidya Department of Mathematics, Saurashtra University, Rajkot-6 5, GUJARAT (INDIA).
More informationProduct Cordial Labeling of Some Cycle Related Graphs
Product Cordial Labeling of Some Cycle Related Graphs A. H. Rokad 1, G. V. Ghodasara 2 1 PhD Scholar, School of Science, RK University, Rajkot - 360020, Gujarat, India 2 H. & H. B. Kotak Institute of Science,
More informationNeighbourhood Prime Labeling On Some Graphs
Neighbourhood Prime Labeling On Some Graphs R. Senthil Amutha 1, N. Murugesan 2 Department of Mathematics, Sree Saraswathi Thyagaraja College, Pollachi, India 1 Department of Mathematics, Government Arts
More informationPrime and Prime Cordial Labeling for Some Special Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2, no. 47, 2347-2356 Prime and Prime Cordial Labeling for Some Special Graphs J. Baskar Babujee and L. Shobana Department of Mathematics Anna University Chennai,
More informationDivisor cordial labeling in context of ring sum of graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (2017), 23-31. ISSN Print : 2249-3328 ISSN Online : 2319-5215 Divisor cordial labeling in context of ring sum of graphs G. V. Ghodasara
More informationVertex Odd Divisor Cordial Labeling for Vertex Switching of Special Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (017), pp. 555 5538 Research India Publications http://www.ripublication.com/gjpam.htm Vertex Odd Divisor Cordial Labeling
More informationCHAPTER 6 ODD MEAN AND EVEN MEAN LABELING OF GRAPHS
92 CHAPTER 6 ODD MEAN AND EVEN MEAN LABELING OF GRAPHS In this chapter we introduce even and odd mean labeling,prime labeling,strongly Multiplicative labeling and Strongly * labeling and related results
More informationON DIFFERENCE CORDIAL GRAPHS
Mathematica Aeterna, Vol. 5, 05, no., 05-4 ON DIFFERENCE CORDIAL GRAPHS M. A. Seoud Department of Mathematics, Faculty of Science Ain Shams University, Cairo, Egypt m.a.seoud@hotmail.com Shakir M. Salman
More informationCHAPTER 5. b-colouring of Line Graph and Line Graph of Central Graph
CHAPTER 5 b-colouring of Line Graph and Line Graph of Central Graph In this Chapter, the b-chromatic number of L(K 1,n ), L(C n ), L(P n ), L(K m,n ), L(K 1,n,n ), L(F 2,k ), L(B n,n ), L(P m ӨS n ), L[C(K
More informationChapter 5. E-cordial Labeling of Graphs
Chapter 5 E-cordial Labeling of Graphs 65 Chapter 5. E-cordial Labeling of Graphs 66 5. Introduction In 987 the concept of cordial labeling was introduced by Cahit [6] as a weaker version of graceful and
More informationVERTEX ODD DIVISOR CORDIAL GRAPHS
Asia Pacific Journal of Research Vol: I. Issue XXXII, October 20 VERTEX ODD DIVISOR CORDIAL GRAPHS A. Muthaiyan and 2 P. Pugalenthi Assistant Professor, P.G. and Research Department of Mathematics, Govt.
More informationOn Sequential Topogenic Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary
More informationNEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS
NEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS A. Muthaiyan # and G. Bhuvaneswari * Department of Mathematics, Government Arts and Science College, Veppanthattai, Perambalur - 66, Tamil Nadu, India. P.G.
More informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
More informationK 4 C 5. Figure 4.5: Some well known family of graphs
08 CHAPTER. TOPICS IN CLASSICAL GRAPH THEORY K, K K K, K K, K K, K C C C C 6 6 P P P P P. Graph Operations Figure.: Some well known family of graphs A graph Y = (V,E ) is said to be a subgraph of a graph
More informationIndexable and Strongly Indexable Graphs
Proceedings of the Pakistan Academy of Sciences 49 (2): 139-144 (2012) Copyright Pakistan Academy of Sciences ISSN: 0377-2969 Pakistan Academy of Sciences Original Article Indexable and Strongly Indexable
More informationPAijpam.eu PRIME CORDIAL LABELING OF THE GRAPHS RELATED TO CYCLE WITH ONE CHORD, TWIN CHORDS AND TRIANGLE G.V. Ghodasara 1, J.P.
International Journal of Pure and Applied Mathematics Volume 89 No. 1 2013, 79-87 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v89i1.9
More informationDefinition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.
Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationOdd Harmonious Labeling of Some Graphs
International J.Math. Combin. Vol.3(0), 05- Odd Harmonious Labeling of Some Graphs S.K.Vaidya (Saurashtra University, Rajkot - 360005, Gujarat, India) N.H.Shah (Government Polytechnic, Rajkot - 360003,
More informationGracefulness of a New Class from Copies of kc 4 P 2n and P 2 * nc 3
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 1 (2012), pp. 75-81 Research India Publications http://www.ripublication.com Gracefulness of a New Class from Copies
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationTHE INSULATION SEQUENCE OF A GRAPH
THE INSULATION SEQUENCE OF A GRAPH ELENA GRIGORESCU Abstract. In a graph G, a k-insulated set S is a subset of the vertices of G such that every vertex in S is adjacent to at most k vertices in S, and
More informationS. K. Vaidya and Rakhimol V. Isaac
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(2015), 191-195 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationHypo-k-Totally Magic Cordial Labeling of Graphs
Proyecciones Journal of Mathematics Vol. 34, N o 4, pp. 351-359, December 015. Universidad Católica del Norte Antofagasta - Chile Hypo-k-Totally Magic Cordial Labeling of Graphs P. Jeyanthi Govindammal
More informationOn Balance Index Set of Double graphs and Derived graphs
International Journal of Mathematics and Soft Computing Vol.4, No. (014), 81-93. ISSN Print : 49-338 ISSN Online: 319-515 On Balance Index Set of Double graphs and Derived graphs Pradeep G. Bhat, Devadas
More informationCycle Related Subset Cordial Graphs
International Journal of Applied Graph Theory Vol., No. (27), 6-33. ISSN(Online) : 2456 7884 Cycle Related Subset Cordial Graphs D. K. Nathan and K. Nagarajan PG and Research Department of Mathematics
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationGraceful Labeling for Cycle of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 6, Number (014), pp. 173 178 International Research Publication House http://www.irphouse.com Graceful Labeling for Cycle of Graphs
More informationChapter 3: Paths and Cycles
Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationPrime Harmonious Labeling of Some New Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 5 Ver. IV (Sep. - Oct.2016), PP 57-61 www.iosrjournals.org Prime Harmonious Labeling of Some New Graphs P.Deepa
More informationGraceful Labeling for Some Star Related Graphs
International Mathematical Forum, Vol. 9, 2014, no. 26, 1289-1293 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.4477 Graceful Labeling for Some Star Related Graphs V. J. Kaneria, M.
More informationCLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN
CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P 11 is hamiltonian.
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationDivisor Cordial Labeling in the Context of Graph Operations on Bistar
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 3 (2016), pp. 2605 2618 Research India Publications http://www.ripublication.com/gjpam.htm Divisor Cordial Labeling in the
More informationEdge-Odd Graceful Labeling for Sum of a Path and a Finite Path
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 9, Number 3 (2017), pp. 323-335 International Research Publication House http://www.irphouse.com Edge-Odd Graceful Labeling
More informationLine Graphs and Circulants
Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),
More informationPrime Labeling for Some Cycle Related Graphs
Journal of Mathematics Research ISSN: 1916-9795 Prime Labeling for Some Cycle Related Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University Rajkot 360 005, Gujarat,
More informationSuper vertex Gracefulness of Some Special Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 07-15 www.iosrjournals.org Super vertex Gracefulness of Some Special Graphs N.Murugesan
More informationSOME GRAPHS WITH n- EDGE MAGIC LABELING
SOME GRAPHS WITH n- EDGE MAGIC LABELING Neelam Kumari 1, Seema Mehra 2 Department of mathematics, M. D. University Rohtak (Haryana), India Abstract: In this paper a new labeling known as n-edge magic labeling
More informationTitle Edge-minimal graphs of exponent 2
Provided by the author(s) and NUI Galway in accordance with publisher policies. Please cite the published version when available. Title Edge-minimal graphs of exponent 2 Author(s) O'Mahony, Olga Publication
More informationSome Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour.
Some Upper Bounds for Signed Star Domination Number of Graphs S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour Abstract Let G be a graph with the vertex set V (G) and edge set E(G). A function
More informationSeema Mehra, Neelam Kumari Department of Mathematics Maharishi Dayanand University Rohtak (Haryana), India
International Journal of Scientific & Engineering Research, Volume 5, Issue 10, October-014 119 ISSN 9-5518 Some New Families of Total Vertex Product Cordial Labeling Of Graphs Seema Mehra, Neelam Kumari
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationCHAPTER 7. b-colouring of Middle Graph and Middle Graph of Central Graph
CHAPTER 7 b-colouring of Middle Graph and Middle Graph of Central Graph In this Chapter, the structural properties of Cycle, Path, Star graph, Fan graph, Sunlet graph, Double Star graph, Bistar, Complete
More information2009 HMMT Team Round. Writing proofs. Misha Lavrov. ARML Practice 3/2/2014
Writing proofs Misha Lavrov ARML Practice 3/2/2014 Warm-up / Review 1 (From my research) If x n = 2 1 x n 1 for n 2, solve for x n in terms of x 1. (For a more concrete problem, set x 1 = 2.) 2 (From this
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into
More informationSigned Product Cordial labeling in duplicate graphs of Bistar, Double Star and Triangular Ladder Graph
Signed Product Cordial labeling in duplicate graphs of Bistar Double Star Triangular Ladder Graph P.P Ulaganathan #1 B. Selvam #2 P. Vijaya kumar #3 12 Department of Mathematics S.I.V.E.T College Gowrivakkam
More informationCHAPTER - 1 INTRODUCTION
CHAPTER - 1 INTRODUCTION INTRODUCTION This thesis comprises of six chapters and is concerned with the construction of new classes of cordial graphs, even and odd graceful graphs, even and odd mean graphs,
More informationTriple Connected Domination Number of a Graph
International J.Math. Combin. Vol.3(2012), 93-104 Triple Connected Domination Number of a Graph G.Mahadevan, Selvam Avadayappan, J.Paulraj Joseph and T.Subramanian Department of Mathematics Anna University:
More informationInternational Journal of Pure and Applied Mathematics
Volume 115 No. 9 017, 363-375 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu EVEN VERTEX MAGIC TOTAL LABELING C.T. NAGARAJ Research Scholar, Department
More informationSome bistar related square sum graphs
(IJMTT) --Volume 47X Number July 2017 2017 Volume, Issue3 Y - Month Some bistar related square sum graphs G. V. Ghodasara 1, Mitesh J. Patel 2 1 Assistant Professor in Mathematics, H. & H. B. Kotak Institute
More informationChromatic Transversal Domatic Number of Graphs
International Mathematical Forum, 5, 010, no. 13, 639-648 Chromatic Transversal Domatic Number of Graphs L. Benedict Michael Raj 1, S. K. Ayyaswamy and I. Sahul Hamid 3 1 Department of Mathematics, St.
More informationSOME RESULTS ON n-edge MAGIC LABELING part 2
International Journal of Scientific & Engineering Research, Volume 7, Issue 4, April-2016 1453 SOME RESULTS ON n-edge MAGIC LABELING part 2 S.Vimala, Assistant Professor, Department of Mathematics, Mother
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationarxiv: v1 [math.co] 28 Dec 2013
On Distance Antimagic Graphs arxiv:131.7405v1 [math.co] 8 Dec 013 Rinovia Simanjuntak and Kristiana Wijaya Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut
More informationSection 8.2 Graph Terminology. Undirected Graphs. Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between u and v.
Section 8.2 Graph Terminology Undirected Graphs Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between u and v. The edge e connects u and v. The vertices u and v are
More informationGraph Algorithms. Chromatic Polynomials. Graph Algorithms
Graph Algorithms Chromatic Polynomials Graph Algorithms Chromatic Polynomials Definition G a simple labelled graph with n vertices and m edges. k a positive integer. P G (k) number of different ways of
More informationAnalysis of Some Bistar Related MMD Graphs
Volume 118 No. 10 2018, 407-413 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v118i10.41 ijpam.eu Analysis of Some Bistar Related MMD
More informationTwo Characterizations of Hypercubes
Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.
More informationEDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS. Jordan Journal of Mathematics and Statistics (JJMS) 8(2), 2015, pp I.
EDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS M.S.A. BATAINEH (1), M.M.M. JARADAT (2) AND A.M.M. JARADAT (3) A. Let k 4 be a positive integer. Let G(n; W k ) denote the class of graphs on n vertices
More informationMath 777 Graph Theory, Spring, 2006 Lecture Note 1 Planar graphs Week 1 Weak 2
Math 777 Graph Theory, Spring, 006 Lecture Note 1 Planar graphs Week 1 Weak 1 Planar graphs Lectured by Lincoln Lu Definition 1 A drawing of a graph G is a function f defined on V (G) E(G) that assigns
More informationEdge-minimal graphs of exponent 2
JID:LAA AID:14042 /FLA [m1l; v1.204; Prn:24/02/2017; 12:28] P.1 (1-18) Linear Algebra and its Applications ( ) Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationDischarging and reducible configurations
Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs
More informationComplete Cototal Domination
Chapter 5 Complete Cototal Domination Number of a Graph Published in Journal of Scientific Research Vol. () (2011), 547-555 (Bangladesh). 64 ABSTRACT Let G = (V,E) be a graph. A dominating set D V is said
More informationGLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES GROUP S 3 CORDIAL PRIME LABELING OF WHEEL RELATED GRAPH B. Chandra *1 & R.
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES GROUP S 3 CORDIAL PRIME LABELING OF WHEEL RELATED GRAPH B. Chandra *1 & R. Kala 2 *1 Reg. No. 7348, Research Scholar, Department of Mathematics, Manonmaniam
More informationZero-Sum Flow Numbers of Triangular Grids
Zero-Sum Flow Numbers of Triangular Grids Tao-Ming Wang 1,, Shih-Wei Hu 2, and Guang-Hui Zhang 3 1 Department of Applied Mathematics Tunghai University, Taichung, Taiwan, ROC 2 Institute of Information
More informationDegree Equitable Domination Number and Independent Domination Number of a Graph
Degree Equitable Domination Number and Independent Domination Number of a Graph A.Nellai Murugan 1, G.Victor Emmanuel 2 Assoc. Prof. of Mathematics, V.O. Chidambaram College, Thuthukudi-628 008, Tamilnadu,
More informationarxiv: v1 [math.co] 28 Sep 2010
Densities of Minor-Closed Graph Families David Eppstein Computer Science Department University of California, Irvine Irvine, California, USA arxiv:1009.5633v1 [math.co] 28 Sep 2010 September 3, 2018 Abstract
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationSome new results on circle graphs. Guillermo Durán 1
Some new results on circle graphs Guillermo Durán 1 Departamento de Ingeniería Industrial, Facultad de Ciencias Físicas y Matemáticas, Universidad de Chile, Santiago, Chile gduran@dii.uchile.cl Departamento
More information1. INTRODUCTION. In 1736, Leonhard Euler wrote a paper on the Seven Bridges of Königsberg
1. INTRODUCTION In 1736, Leonhard Euler wrote a paper on the Seven Bridges of Königsberg which is regarded as the first paper in the history of graph theory. Graph theory is now a major tool in mathematical
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationVertex-graceful labelings for some double cycles
Vertex-graceful labelings for some double cycles Wai Chee SHIU Department of Mathematics Hong Kong Baptist University. June 28, 2011 Vertex-graceful labelings for some double cycles p. 1/2 Vertex-graceful
More informationOn the Graceful Cartesian Product of Alpha-Trees
Theory and Applications of Graphs Volume 4 Issue 1 Article 3 017 On the Graceful Cartesian Product of Alpha-Trees Christian Barrientos Clayton State University, chr_barrientos@yahoo.com Sarah Minion Clayton
More informationVertex Magic Total Labelings of Complete Graphs 1
Vertex Magic Total Labelings of Complete Graphs 1 Krishnappa. H. K. and Kishore Kothapalli and V. Ch. Venkaiah Centre for Security, Theory, and Algorithmic Research International Institute of Information
More informationSuper Fibonacci Graceful Labeling Of Some Cycle Related Graphs
International Journal of Mathematics Trends and Technology (IJMTT) Volume 3 Number 3 - October06 Super Fibonacci Graceful Labeling Of Some Cycle Related Graphs D.Amuthavalli, M. Premkumar Assistant Professor
More informationPrime Labeling For Some Octopus Related Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 6 Ver. III (Nov. - Dec.2016), PP 57-64 www.iosrjournals.org Prime Labeling For Some Octopus Related Graphs A.
More informationBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
Iranian Journal of Mathematical Sciences and Informatics Vol. 13, No. 2 (2018), pp 1-13 DOI: 10.7508/ijmsi.2018.13.001 Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationMATH 363 Final Wednesday, April 28. Final exam. You may use lemmas and theorems that were proven in class and on assignments unless stated otherwise.
Final exam This is a closed book exam. No calculators are allowed. Unless stated otherwise, justify all your steps. You may use lemmas and theorems that were proven in class and on assignments unless stated
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationAn Introduction to Graph Theory
An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of
More informationCMSC 380. Graph Terminology and Representation
CMSC 380 Graph Terminology and Representation GRAPH BASICS 2 Basic Graph Definitions n A graph G = (V,E) consists of a finite set of vertices, V, and a finite set of edges, E. n Each edge is a pair (v,w)
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationv V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
More informationA Vizing-like theorem for union vertex-distinguishing edge coloring
A Vizing-like theorem for union vertex-distinguishing edge coloring Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau Abstract We introduce a variant of the vertex-distinguishing
More information5 Graphs
5 Graphs jacques@ucsd.edu Some of the putnam problems are to do with graphs. They do not assume more than a basic familiarity with the definitions and terminology of graph theory. 5.1 Basic definitions
More informationRecognizing Interval Bigraphs by Forbidden Patterns
Recognizing Interval Bigraphs by Forbidden Patterns Arash Rafiey Simon Fraser University, Vancouver, Canada, and Indiana State University, IN, USA arashr@sfu.ca, arash.rafiey@indstate.edu Abstract Let
More informationWORM COLORINGS. Wayne Goddard. Dept of Mathematical Sciences, Clemson University Kirsti Wash
1 2 Discussiones Mathematicae Graph Theory xx (xxxx) 1 14 3 4 5 6 7 8 9 10 11 12 13 WORM COLORINGS Wayne Goddard Dept of Mathematical Sciences, Clemson University e-mail: goddard@clemson.edu Kirsti Wash
More information