ON A WEAKER VERSION OF SUM LABELING OF GRAPHS
|
|
- Rudolph Norton
- 6 years ago
- Views:
Transcription
1 ON A WEAKER VERSION OF SUM LABELING OF GRAPHS IMRAN JAVAID, FARIHA KHALID, ALI AHMAD and M. IMRAN Communicated by the former editorial board In this paper, we introduce super weak sum labeling and weak sum labeling of a graph G with vertex set V and edge set E, defined as follows: A super weak sum (briefly sw-sum) labeling is a bijection L : V {1, 2,..., V } such that for every edge (u, v) in G, there is a vertex w in G with L(u) + L(v) = L(w). A graph that can be sw-sum labeled is called an sw-sum graph. It is obvious that an sw-sum graph cannot be connected. There must be at least one isolated vertex, namely the vertex with the largest label. The sw-sum number, ω(h), of a connected graph H is the least number r of isolated vertices K r such that G = H K r is an sw-sum graph. If the set {1, 2,..., V } is replaced by some subset S of Z + in the definition of sw-sum labeling, then such a labeling will be referred to as weak sum (briefly w-sum) labeling and the minimum number of isolates in such a labeling as w-sum number. We show that a lower bound for the sw-sum number is the minimum degree δ of a vertex in the graph. Graphs achieving this bound will be referred to as δ-optimal sw-summable. We provide labeling schemes for different families of graphs showing that they are δ-optimal sw-summable. We show that not all the graphs are δ-optimal sw-summable and conjecture that all the graphs are δ-optimal w-summable. AMS 2010 Subject Classification: 05C78, 05C62. Key words: sum graph, super weak sum labeling, weak sum labeling. 1. INTRODUCTION All the graphs considered in this paper are simple, finite and undirected. If a graph G has p vertices and q edges, then G will be referred to as (p, q)- graph and by [p], we mean the set {1, 2,..., p}. For a vertex v, the set of vertices adjacent with v are referred to as the neighborhood of v, denoted by N(v) and N(v) is the degree of v. A graph G is called a sum graph if there exists a labeling of the vertices of G by distinct positive integers such that the vertices u and v are adjacent if and only if there exists a vertex whose label is equal to the sum of labels of u and v. The sum number, σ(h), of a graph H is the least number r of isolated vertices needed so that G = H K r is a sum graph [1]. All sum graphs are MATH. REPORTS 16(66), 3 (2014),
2 414 Imran Javaid, Fariha Khalid, Ali Ahmad and M. Imran 2 necessarily disconnected. There must be at least one isolated vertex, namely the vertex with the largest label, so that the sum number r of a connected graph is always more than or equal to one. Sum labelings have important applications in graph storage. Many variations of sum labelings have been studied, for example integer sum labelings [2], mod sum labeling [2], exclusive sum labelings [4], sum* labeling [5] and mod sum* labeling [5]. In this paper, we are introducing a weaker version of sum labeling of a (p, q)-graph G, namely super weak sum (briefly sw-sum) labeling using integers from the set [p] in the following way: A labeling L : V [p] is called super weak sum labeling if for any (u, v) E(G), there exists a vertex w in G such that L(u) + L(v) = L(w). sw-sum graphs are necessarily disconnected so in order to sw-sum label a connected graph H, it becomes necessary to add a set of isolated vertices known as isolates as a disjoint union and the labeling scheme that requires the fewest isolates is termed as optimal. By this method, any graph can be embedded in an sw-sum graph by adding sufficient isolates. The smallest number of isolates required for a graph H to support an sw-sum labeling is known as the sw-sum number of a graph, denoted by ω(h). It is evident that ω(h) q. A lower bound for the sw-sum number of a graph is the minimum degree δ of a vertex in the graph. We prove this in the following lemma: Lemma 1.1. A lower bound for the sw-sum number ω(h) of a graph H is the minimum degree δ of a vertex in the graph. Proof. Let v V (H) be a vertex with maximum label. Then it has at least δ neighbors v 1, v 2,..., v δ. Since sum of labels of v and v i ; i = 1, 2,..., δ must be a label of another vertex, so we must have δ isolates to sw-sum label this graph. Hence δ ω(h). An sw-sum graph is termed as δ-optimal sw-summable if it needs δ isolates to sw-sum label a graph. If the set [p] is replaced by some subset S of Z + in the definition of swsum labeling, then such a labeling is referred to as weak sum (briefly w-sum) labeling. Since w-sum graphs are generalization of sw-sum graphs, so all the terminology mentioned above for sw-sum graphs holds for w-sum graphs as well. Note that, if all the labels x [p] of vertices in a graph G are replaced by kx for some k Z +, then this graph receives the labels from k[p] and the sum of labels of every two distinct vertices is a label of another vertex in G. Hence, we have the following lemma:
3 3 On a weaker version of sum labeling of graphs 415 Lemma 1.2. Every (p, q)-graph which is sw-summable is w-summable. Observation 1.3. In a δ-optimal sw-summable graph, if the degree of a vertex v receiving the largest label is d, then vertices in N(v) receive labels from the set [d]. If a (p, q)-graph is w-summable, then it may not be δ-optimal sw-summable. In order to show this first we define Cayley graph: Let X be a group and S X\{1}, an inverse closed subset. The Cayley graph Cay(X, S) is a graph with the vertex set X and two vertices x, y X adjacent whenever xy 1 S. Consider the w-sum labeling of Cay(Z 8, {±1, ±2}) K 4 in Figure 1. However, this graph does not support sw-sum labeling. By Observation 1.3, suppose that the vertex v 0 receives label 8, then the vertices v 1, v 2, v 6 and v 7 will receive labels from the set [4] and the vertices v 3, v 4 and v 5 will receive labels from the set {5, 6, 7}. It can be seen that there exists an edge say (x, y) with one vertex say x having label 7 such that L(x) + L(y) / [12]. Fig. 1 Weak sum labeling of Cay(Z 8, {±1, ±2}) K 4. Let L and L be two optimal w-sum labelings of a graph G. Labeling L is said to be smaller than L if the largest label under L is less than the largest label under L. From this definition, it follows that sw-sum labeling is the smallest w-sum labeling. In the next section, we provide labeling schemes showing that paths are 1- optimal sw-summable, cycles are 2-optimal sw-summable, wheels are 3-optimal sw-summable, complete graphs are (n 1)-optimal sw-summable and complete multipartite graphs K n1,n 2,...,n q are t-optimal sw-summable, where t is the minimum degree of a vertex in K n1,n 2,...,n q. Throughout the paper, the vertices are identified by their labels under L.
4 416 Imran Javaid, Fariha Khalid, Ali Ahmad and M. Imran 4 2. SUPER WEAK SUM LABELING Let P n and C n be path and cycle on n vertices. We show that paths are 1-optimal summable and cycles are 2-optimal summable by providing sw-sum labeling schemes of P n K 1 and C n K 2. Labeling scheme for P n K 1 : The vertex set of P n K 1 is given as {v 1, v 2,..., v n } {s 1 }. Let n = 2k or n = 2k + 1 depending upon whether n is even or odd. Define v 2i = i for i [k] and v 2i+1 = n i for i from 0 to k 1 or k depending upon whether n is even or odd, respectively, and s 1 = n + 1. Labeling scheme for C n K 2 : Let V (C n K 2 ) = {w 1, w 2,..., w n } {t 1, t 2 }. Let n = 2k or n = 2k + 1 depending upon whether n is even or odd. Define w 2i = n i + 1 for i [k] and w 2i+1 = i + 1 for i from 0 to k 1 or k depending upon whether n is even or odd, respectively, and t j = n + j for j = 1, 2. It is easy to see that P n K 1 and C n K 2 are sw-sum graphs. Hence, we have the following result: Theorem 2.1. ω(p n ) = 1 for all n 2 and ω(c n ) = 2 for all n 3. For every integer n 3, a wheel W n = (V, E) is a graph with V = {c, v 0, v 1,..., v n 1 }, E = {(c, v i ), (v i, v i+1 ) i = 0, 1,..., n 1} where indices of the vertices are considered modulo n. The vertex c is called the center of the wheel, each edge (c, v i ), for i = 0, 1, 2,..., n 1, is called a spoke, the vertices v 0, v 1,..., v n 1 are referred to as rim vertices and each edge (v i, v i+1 ) for i = 0, 1,..., n 1 is called a rim edge. Now, we show that wheels are 3-optimal sw-summable. Theorem 2.2. ω(w n ) = 3 for all n 3. Proof. By Lemma 1.1, ω(w n ) 3. Following is the labeling scheme for the wheels with three isolates: Let n = 2k or n = 2k + 1 depending upon whether n is even or odd. Label the central vertex by c = 1. Set d = n + 1. Assign labels to the vertices as v 2i = i + 2 and v 2i+1 = d i, where i [k 1] {0} for n even. For n odd we define v 2i = i + 2, where i [k] {0} and v 2i+1 = d i, where i [k 1] {0}. After labeling all the vertices of the graph W n, d is the maximum label on the graph. Note that v 1 = d, so v 1 + c = d + 1. v 0 + v 1 = d + 2 and v 1 + v 2 = d + 3 are larger than the maximum label in the graph. Hence, there must be three isolates with labels d + 1, d + 2 and d + 3. It is easy to see that the sum of the labels of every spoke and rim edge is a label of another vertex. Hence, the wheel W n is 3-optimal sw-summable. Let K n be a complete graph with vertex set {v 1, v 2,..., v n }. Now, we show that ω(k n ) = n 1 for all n 2.
5 5 On a weaker version of sum labeling of graphs 417 Theorem 2.3. For all n 2, ω(k n ) = n 1. Proof. Following is the sw-sum labeling scheme for complete graph K n with n 1 isolates: Let n = 2k or n = 2k +1 depending upon whether n is even or odd. Starting from any vertex, label the vertices as: v i = i, i = 1, 2,..., n. Since v i is adjacent with n 1 vertices, so there must be n 1 isolates. Consider any vertex v j then the edges incident at v j are (v i, v j ) with i j and i [n] \ {j}, j [n] \ {i}. Note that if i + j < n, then there is a vertex v k with k = i+j such that, v k = v i +v j and if i+j > n, then v i +v j [2n 1]\[n], which means (v i, v j ) is labeled by an isolate. Hence (v i, v j ) is an edge. We see that the sum of the labels of every edge on the graph K n is a label of another vertex. By Lemma 1.1, we conclude that ω(k n ) n 1. This gives that ω(k n ) = n 1 for all n. A complete multipartite graph is a graph whose vertex set can be partitioned into q subsets V 1, V 2,..., V q such that every (u, v) is an edge if and only if u and v belong to different partite sets. If V i = n i, 1 i q, then we denote complete multipartite graph as K n1,n 2,...,n q. For labeling purpose, we arrange the q-partitions in such a way that n 1 n 2... n q where n i s are the number of vertices in V i -class. We name the vertices from the classes V 1, V 2,..., V q as v 1, v 2,..., v n1, v n1 +1,..., v n1 +n 2,..., v s where s = n 1 +n n q. Now, since V q is the class having maximum number of vertices n q, so they attain the minimum degree. Let t denotes the minimum degree of a vertex in K n1,n 2,...,n q then t = s n q. In the following theorem, we shall prove that ω(k n1,n 2,...,n q ) = s n q. Theorem 2.4. K n1,n 2,...,n q is δ-optimal super weak summable. Proof. Let V = {V 1, V 2,..., V q } be the vertex set of K n1,n 2,...,n q and s = n 1 + n n q be the total number of vertices in the graph. Now, assign labels to the vertices as: v i = i, i [s]. The maximum label is s which is the label of the vertex v s. Now, the sum of v s + v i = s + i, i [t]. Since v s has maximum label on the graph, so the labels v s + v i are greater than the maximum label s, so they must be the isolates. Labels of the vertices of K n1,n 2,...,n q form the sequence {1, 2,..., s, s + 1,..., s + t}, so v s j + v i = s j + i {1, 2,..., s, s + 1,..., s + t}, i [s 1], j [s] and i s j. This shows that the sum of labels of every vertex is the label of another vertex on the graph. Since s j + i < s + i and they results in minimum isolates. This shows that K n1,n 2,...,n q can be sw-sum labeled using t isolates, so ω(k n1,n 2,...,n q ) t. Hence, by Lemma 1.1, ω(k n1,n 2,...,n q ) = t for all n i, i = 1, 2,..., q.
6 418 Imran Javaid, Fariha Khalid, Ali Ahmad and M. Imran 6 Corollary 2.5. Let K m,n be a bipartite graph then ω(k m,n ) = m if m n. In particular, ω(s n ) = ω(k 1,n ) = 1, where S n is a star. 3. WEAK SUM LABELING OF Cay(Z n, {±1, ±2}) We note that paths, cycles, wheels, complete graphs, complete multipartite graphs and stars are all δ-optimal sw-summable graphs. Earlier it was shown that Cay(Z 8, {±1, ±2}) K 4 is not sw-summable but w-summable. In this section, we show that Cay(Z n, {±1, ±2}) K 4 is w-summable for all n 5. Theorem 3.1. For all n 5, Cay(Z n, {±1, ±2}) is 4-optimal w-summable. Proof. Let v 0, v 1,..., v n 1 be the vertices of Cay(Z n, {±1, ±2}), where n = 3k + r, k Z + and r = 0, 1, 2. To show that Cay(Z n, {±1, ±2}) is 4- optimal w-summable, we define the labeling as follows: { i + 1(0 i k 1), r = 0, v 3i = i + 1(0 i k), r = 1, 2, v 3i+1 = { n i(0 i k 1), r = 0, 1, 2, k i(0 i k 2), r = 0, v 3i+2 = k i(0 i k 1), r = 1, k i(0 i k 1), r = 2, for r = 0, v 3k 1 = k + 1 and for r = 2, v 3k+1 = k + 2. Note that v 1 = n is the largest label of a vertex in the graph and v 0 +v 1 = n + 1, v 1 + v 3 = n + 2 for r = 0, 1, 2, v 1 + v 2 = v 1 + v n 1 = 4k + 2, r = 0, 4k + 3, r = 1, 4k + 5, r = 2, 4k + 1, r = 0, 4k + 2, r = 1, 4k + 4, r = 2. Now, it remains to show that v i + v j {v 1, v 2,..., v n 1 } {v 0 + v 1, v 1 + v 2, v 1 + v 3, v 1 + v n 1 } whenever (v i, v j ) is an edge. Note that { n + 2(1 i k 1), r = 0, v 3i + v 3i 2 = n + 2(1 i k), r = 1, 2, { k + 2i + 2(0 i k 1), r = 0, 1, v 3i + v 3i 1 = k + 2i + 3(0 i k 1), r = 3, v 3i + v 3i+1 = { n + 1(0 i k 1), r = 0, 1, 2,
7 7 On a weaker version of sum labeling of graphs 419 k i(0 i k 2), r = 0, v 3i + v 3i+2 = k i(0 i k 1), r = 1, k i(0 i k 1), r = 2, { n + k + 1(0 i k 1), r = 0, 1, v 3i 1 + v 3i+1 = n + k + 2(0 i k 1), r = 3, n + k + 2(0 i k 2), r = 0, v 3i+1 + v 3i+2 = n + k + 2(0 i k 1), r = 1, n + k + 3(0 i k 1), r = 2, { 2k + 2, r = 0, 1, v 0 + v n 2 = k + 2, r = 2, { 3k + 2, r = 0, 1, v n 2 + v n 1 = 2k + 3, r = 2, for r = 0, v 3k 3 + v 3k 1 = 2k + 1 and for r = 2, v n 3 + v n 2 = 3(k + 1), v n 3 + v n 1 = 3k + 4. We see that the sum of the labels of every edge is a label of another vertex. We conclude that Cay(Z n, {±1, ±2}) with n 5 can be weak sum labeled using only four isolates. Hence, by Lemma 1.1, Cay(Z n, {±1, ±2}) is 4-optimal w-summable. Concluding Remarks: In this paper, we have introduced a weaker version of sum labeling of a (p, q) graph using labels from the set [p]. We have seen that wheels, complete graphs, complete bipartite graphs can be super weak sum labeled using δ isolates. Also, note that a b [p] for any a, b [p]. Hence, if we define super difference labeling by replacing L(u) + L(v) with L(u) L(v) in the definition of sw-sum labeling, then all the classes of graphs mentioned above are super difference graphs. We note that not all the graphs are sw-summable and give w-sum labeling of Cay(Z n, {±1, ±2}). We have the following conjecture and open question for further work on this paper. Conjecture 3.2. All graphs are δ-optimal w-summable. Open Problem 3.3. Does there exist a graph which is an sw-sum graph but not δ-optimal sw-summable? Acknowledgments. The authors are grateful to the anonymous referee whose careful reading and valuable suggestions resulted in producing an improved paper. REFERENCES [1] F. Harary, Sum graphs and difference graphs. Congr. Numer. 72 (1990), [2] F. Harary, Sum graphs over all the integers. Discrete Math. 124 (1994), [3] K.M. Koh, M. Miller, W.F. Smyth and Y. Wang, On optimal summable graphs. Submitted for publication.
8 420 Imran Javaid, Fariha Khalid, Ali Ahmad and M. Imran 8 [4] M. Miller, J.F. Ryan, Slamin, K. Sugeng and M. Tuga, Exclusive sum graph labelings. Preprint. [5] M. Sutton, Summable graph labelings and their applications. Ph.D. Thesis, October Received 31 May 2012 Bahauddin Zakariya University Multan, Center for Advanced Studies in Pure and Applied Mathematics, Pakistan ijavaidbzu@gmail.com National University of Computer and Emerging Sciences, FAST, Lahore, Pakistan L125505@nu.edu.pk Jazan University, College of Computer and Information System, Jazan, KSA, ahmadsms@gmail.com National University of Sciences and Technology, Center for Advanced Mathematics and Physics, Islamabad, Pakistan, imrandhab@gmail.com
Labelling Wheels for Minimum Sum Number. William F. SMYTH. Abstract. A simple undirected graph G is called a sum graph if there exists a
Labelling Wheels for Minimum Sum Number Mirka MILLER Department of Computer Science University of Newcastle, NSW 308, Australia e-mail: mirka@cs.newcastle.edu.au SLAMIN Department of Computer Science University
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 informationThe Restrained Edge Geodetic Number of a Graph
International Journal of Computational and Applied Mathematics. ISSN 0973-1768 Volume 11, Number 1 (2016), pp. 9 19 Research India Publications http://www.ripublication.com/ijcam.htm The Restrained Edge
More informationOn vertex-coloring edge-weighting of graphs
Front. Math. China DOI 10.1007/s11464-009-0014-8 On vertex-coloring edge-weighting of graphs Hongliang LU 1, Xu YANG 1, Qinglin YU 1,2 1 Center for Combinatorics, Key Laboratory of Pure Mathematics and
More informationStrong and Semi Strong Outer Mod Sum Graphs
Int. Journal of Math. Analysis, Vol. 7, 013, no., 73-83 Strong and Semi Strong Outer Mod Sum Graphs M. Jayalakshmi and B. Sooryanarayana Dept.of Mathematical and Computational Studies Dr.Ambedkar 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 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 informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationVERTEX-MAGIC TOTAL LABELINGS OF DISCONNECTED GRAPHS
Journal of Prime Research in Mathematics Vol. (006), 147-156 VERTEX-MAGIC TOTAL LABELINGS OF DISCONNECTED GRAPHS SLAMIN 1,, A.C. PRIHANDOKO 1, T.B. SETIAWAN 1, F. ROSITA 1, B. SHALEH 1 Abstract. Let G
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 informationGraphs. Pseudograph: multiple edges and loops allowed
Graphs G = (V, E) V - set of vertices, E - set of edges Undirected graphs Simple graph: V - nonempty set of vertices, E - set of unordered pairs of distinct vertices (no multiple edges or loops) Multigraph:
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 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 informationVertex Magic Total Labelings of Complete Graphs
AKCE J. Graphs. Combin., 6, No. 1 (2009), pp. 143-154 Vertex Magic Total Labelings of Complete Graphs H. K. Krishnappa, Kishore Kothapalli and V. Ch. Venkaiah Center for Security, Theory, and Algorithmic
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 informationOuter-2-independent domination in graphs
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 126, No. 1, February 2016, pp. 11 20. c Indian Academy of Sciences Outer-2-independent domination in graphs MARCIN KRZYWKOWSKI 1,2,, DOOST ALI MOJDEH 3 and MARYEM
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 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 informationInfinite locally random graphs
Infinite locally random graphs Pierre Charbit and Alex D. Scott Abstract Motivated by copying models of the web graph, Bonato and Janssen [3] introduced the following simple construction: given a graph
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 informationPROPERLY EVEN HARMONIOUS LABELINGS OF DISJOINT UNIONS WITH EVEN SEQUENTIAL GRAPHS
Volume Issue July 05 Discrete Applied Mathematics 80 (05) PROPERLY EVEN HARMONIOUS LABELINGS OF DISJOINT UNIONS WITH EVEN SEQUENTIAL GRAPHS AUTHORS INFO Joseph A. Gallian*, Danielle Stewart Department
More information(5.2) 151 Math Exercises. Graph Terminology and Special Types of Graphs. Malek Zein AL-Abidin
King Saud University College of Science Department of Mathematics 151 Math Exercises (5.2) Graph Terminology and Special Types of Graphs Malek Zein AL-Abidin ه Basic Terminology First, we give some terminology
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 informationCharacterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
More informationThe vertex set is a finite nonempty set. The edge set may be empty, but otherwise its elements are two-element subsets of the vertex set.
Math 3336 Section 10.2 Graph terminology and Special Types of Graphs Definition: A graph is an object consisting of two sets called its vertex set and its edge set. The vertex set is a finite nonempty
More informationOn the vertex irregular total labeling for subdivision of trees
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(2) (2018), Pages 293 302 On the vertex irregular total labeling for subdivision of trees Susilawati Edy Tri Baskoro Rinovia Simanjuntak Combinatorial Mathematics
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
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 informationAMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.
AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a
More informationGeneralized Pebbling Number
International Mathematical Forum, 5, 2010, no. 27, 1331-1337 Generalized Pebbling Number A. Lourdusamy Department of Mathematics St. Xavier s College (Autonomous) Palayamkottai - 627 002, India lourdugnanam@hotmail.com
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 informationCPCS Discrete Structures 1
Let us switch to a new topic: Graphs CPCS 222 - Discrete Structures 1 Introduction to Graphs Definition: A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs
More informationPartitioning Complete Multipartite Graphs by Monochromatic Trees
Partitioning Complete Multipartite Graphs by Monochromatic Trees Atsushi Kaneko, M.Kano 1 and Kazuhiro Suzuki 1 1 Department of Computer and Information Sciences Ibaraki University, Hitachi 316-8511 Japan
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 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 informationMatching and Factor-Critical Property in 3-Dominating-Critical Graphs
Matching and Factor-Critical Property in 3-Dominating-Critical Graphs Tao Wang a,, Qinglin Yu a,b a Center for Combinatorics, LPMC Nankai University, Tianjin, China b Department of Mathematics and Statistics
More informationOn the total edge irregularity strength of hexagonal grid graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 5 (01), Pages 6 71 On the total edge irregularity strength of hexagonal grid graphs O Al-Mushayt Ali Ahmad College of Computer Sciences & Information Systems
More informationGEODETIC DOMINATION IN GRAPHS
GEODETIC DOMINATION IN GRAPHS H. Escuadro 1, R. Gera 2, A. Hansberg, N. Jafari Rad 4, and L. Volkmann 1 Department of Mathematics, Juniata College Huntingdon, PA 16652; escuadro@juniata.edu 2 Department
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 informationResearch Question Presentation on the Edge Clique Covers of a Complete Multipartite Graph. Nechama Florans. Mentor: Dr. Boram Park
Research Question Presentation on the Edge Clique Covers of a Complete Multipartite Graph Nechama Florans Mentor: Dr. Boram Park G: V 5 Vertex Clique Covers and Edge Clique Covers: Suppose we have a graph
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 informationSmall Survey on Perfect Graphs
Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families
More informationThe extendability of matchings in strongly regular graphs
The extendability of matchings in strongly regular graphs Sebastian Cioabă Department of Mathematical Sciences University of Delaware Villanova, June 5, 2014 Introduction Matching A set of edges M of a
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 informationStar Decompositions of the Complete Split Graph
University of Dayton ecommons Honors Theses University Honors Program 4-016 Star Decompositions of the Complete Split Graph Adam C. Volk Follow this and additional works at: https://ecommons.udayton.edu/uhp_theses
More informationProperly even harmonious labelings of disconnected graphs
Available online at www.sciencedirect.com ScienceDirect AKCE International Journal of Graphs and Combinatorics 12 (2015) 193 203 www.elsevier.com/locate/akcej Properly even harmonious labelings of disconnected
More informationThe Cartesian product of cycles C n1, C n2,, C ns, denoted C n1 C n2 C ns can be viewed as the Cayley graph of Abelian group Z n1 Z n2 Z ns
Vertex-magic edge Z 2nm -labeling of C n C m Dalibor Froncek, University of Minnesota Duluth James McKeown, University of Miami John McKeown, University of Minnesota Duluth Michael McKeown, University
More informationThe Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph
Applied Mathematics E-Notes, 15(2015), 261-275 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ The Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph KrishnaPillai
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 informationThe crossing number of K 1,4,n
Discrete Mathematics 308 (2008) 1634 1638 www.elsevier.com/locate/disc The crossing number of K 1,4,n Yuanqiu Huang, Tinglei Zhao Department of Mathematics, Normal University of Hunan, Changsha 410081,
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationStar coloring planar graphs from small lists
Star coloring planar graphs from small lists André Kündgen Craig Timmons June 4, 2008 Abstract A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We
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 informationThe Lower and Upper Forcing Edge-to-vertex Geodetic Numbers of a Graph
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 6, June 2016, PP 23-27 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/10.20431/2347-3142.0406005
More informationGap vertex-distinguishing edge colorings of graphs
Gap vertex-distinguishing edge colorings of graphs M. A Tahraoui 1 E. Duchêne H. Kheddouci Université de Lyon, Laboratoire GAMA, Université Lyon 1 43 bd du 11 Novembre 1918, F-696 Villeurbanne Cedex, France
More informationDEFINITION OF GRAPH GRAPH THEORY GRAPHS ACCORDING TO THEIR VERTICES AND EDGES EXAMPLE GRAPHS ACCORDING TO THEIR VERTICES AND EDGES
DEFINITION OF GRAPH GRAPH THEORY Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each
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 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 informationλ -Harmonious Graph Colouring
λ -Harmonious Graph Colouring Lauren DeDieu McMaster University Southwestern Ontario Graduate Mathematics Conference June 4th, 201 What is a graph? What is vertex colouring? 1 1 1 2 2 Figure : Proper Colouring.
More informationIntroduction to Graphs
Graphs Introduction to Graphs Graph Terminology Directed Graphs Special Graphs Graph Coloring Representing Graphs Connected Graphs Connected Component Reading (Epp s textbook) 10.1-10.3 1 Introduction
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 informationThe Dual Neighborhood Number of a Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 47, 2327-2334 The Dual Neighborhood Number of a Graph B. Chaluvaraju 1, V. Lokesha 2 and C. Nandeesh Kumar 1 1 Department of Mathematics Central College
More informationOn total domination and support vertices of a tree
On total domination and support vertices of a tree Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper and Bill Waller University of Houston-Downtown, Houston, Texas 7700 delavinae@uhd.edu, pepperr@uhd.edu,
More informationChapter 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 informationOn vertex types of graphs
On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph
More informationTHE THICKNESS OF THE COMPLETE MULTIPARTITE GRAPHS AND THE JOIN OF GRAPHS
THE THICKNESS OF THE COMPLETE MULTIPARTITE GRAPHS AND THE JOIN OF GRAPHS YICHAO CHEN AND YAN YANG Abstract. The thickness of a graph is the minimum number of planar s- panning subgraphs into which the
More informationTHE RESTRAINED EDGE MONOPHONIC NUMBER OF A GRAPH
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(1)(2017), 23-30 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationMath.3336: Discrete Mathematics. Chapter 10 Graph Theory
Math.3336: Discrete Mathematics Chapter 10 Graph Theory Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationComplementary Acyclic Weak Domination Preserving Sets
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 30-9364, ISSN (Print): 30-9356 ijresorg Volume 4 Issue 7 ǁ July 016 ǁ PP 44-48 Complementary Acyclic Weak Domination
More informationNeighbor Sum Distinguishing Index
Graphs and Combinatorics (2013) 29:1329 1336 DOI 10.1007/s00373-012-1191-x ORIGINAL PAPER Neighbor Sum Distinguishing Index Evelyne Flandrin Antoni Marczyk Jakub Przybyło Jean-François Saclé Mariusz Woźniak
More informationComplete Bipartite Graphs with No Rainbow Paths
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 10, 455-462 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2016.6951 Complete Bipartite Graphs with No Rainbow
More informationSharp lower bound for the total number of matchings of graphs with given number of cut edges
South Asian Journal of Mathematics 2014, Vol. 4 ( 2 ) : 107 118 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Sharp lower bound for the total number of matchings of graphs with given number of cut
More informationPebbling on Directed Graphs
Pebbling on Directed Graphs Gayatri Gunda E-mail: gundagay@notes.udayton.edu Dr. Aparna Higgins E-mail: Aparna.Higgins@notes.udayton.edu University of Dayton Dayton, OH 45469 Submitted January 25 th, 2004
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 informationTheorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.
3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching
More informationWeak Dynamic Coloring of Planar Graphs
Weak Dynamic Coloring of Planar Graphs Caroline Accurso 1,5, Vitaliy Chernyshov 2,5, Leaha Hand 3,5, Sogol Jahanbekam 2,4,5, and Paul Wenger 2 Abstract The k-weak-dynamic number of a graph G is the smallest
More informationDiscrete Mathematics. Elixir Dis. Math. 92 (2016)
38758 Available online at www.elixirpublishers.com (Elixir International Journal) Discrete Mathematics Elixir Dis. Math. 92 (2016) 38758-38763 Complement of the Boolean Function Graph B(K p, INC, K q )
More informationMatchings in Graphs. Definition 1 Let G = (V, E) be a graph. M E is called as a matching of G if v V we have {e M : v is incident on e E} 1.
Lecturer: Scribe: Meena Mahajan Rajesh Chitnis Matchings in Graphs Meeting: 1 6th Jan 010 Most of the material in this lecture is taken from the book Fast Parallel Algorithms for Graph Matching Problems
More informationTraveling in Networks with Blinking Nodes
Theory and Applications of Graphs Volume 5 Issue 1 Article 2 January 2018 Traveling in Networks with Blinking Nodes Braxton Carrigan Southern CT State University, carriganb1@southernct.edu James Hammer
More informationCONNECTIVITY AND NETWORKS
CONNECTIVITY AND NETWORKS We begin with the definition of a few symbols, two of which can cause great confusion, especially when hand-written. Consider a graph G. (G) the degree of the vertex with smallest
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 informationAVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH
italian journal of pure and applied mathematics n. 33 2014 (293 298) 293 AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH D. Reddy Babu Department of Mathematics Koneru Lakshmaiah Education Foundation (K.L.
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 informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationVertex-antimagic total labelings of graphs
Vertex-antimagic total labelings of graphs Martin Bača Department of Applied Mathematics Technical University, 0400 Košice, Slovak Republic e-mail: hollbaca@ccsun.tuke.sk François Bertault Department of
More information1 Matchings in Graphs
Matchings in Graphs J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 Definition Two edges are called independent if they are not adjacent
More informationNote A further extension of Yap s construction for -critical graphs. Zi-Xia Song
Discrete Mathematics 243 (2002) 283 290 www.elsevier.com/locate/disc Note A further extension of Yap s construction for -critical graphs Zi-Xia Song Department of Mathematics, National University of Singapore,
More informationVertex-Mean Graphs. A.Lourdusamy. (St.Xavier s College (Autonomous), Palayamkottai, India) M.Seenivasan
International J.Math. Combin. Vol. (0), -0 Vertex-Mean Graphs A.Lourdusamy (St.Xavier s College (Autonomous), Palayamkottai, India) M.Seenivasan (Sri Paramakalyani College, Alwarkurichi-67, India) E-mail:
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 informationRADIO LABELING OF SOME LADDER-RELATED GRAPHS
RADIO LABELING OF SOME LADDER-RELATED GRAPHS ALI AHMAD and RUXANDRA MARINESCU-GHEMECI Communicated by Ioan Tomescu Let d(u, v) denote the distance between two distinct vertices of a connected graph G,
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 informationSome relations among term rank, clique number and list chromatic number of a graph
Discrete Mathematics 306 (2006) 3078 3082 www.elsevier.com/locate/disc Some relations among term rank, clique number and list chromatic number of a graph Saieed Akbari a,b, Hamid-Reza Fanaï a,b a Department
More informationEFFICIENT BONDAGE NUMBER OF A JUMP GRAPH
EFFICIENT BONDAGE NUMBER OF A JUMP GRAPH N. Pratap Babu Rao Associate Professor S.G. College Koppal(Karnataka), INDIA --------------------------------------------------------------------------------***------------------------------------------------------------------------------
More informationModular Representations of Graphs
Modular Representations of Graphs Crystal Altamirano, Stephanie Angus, Lauren Brown, Joseph Crawford, and Laura Gioco July 2011 Abstract A graph G has a representation modulo r if there exists an injective
More informationVertex Deletion games with Parity rules
Vertex Deletion games with Parity rules Richard J. Nowakowski 1 Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada rjn@mathstat.dal.ca Paul Ottaway Department of Mathematics,
More informationGraph Theory Mini-course
Graph Theory Mini-course Anthony Varilly PROMYS, Boston University, Boston, MA 02215 Abstract Intuitively speaking, a graph is a collection of dots and lines joining some of these dots. Many problems in
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 informationAbstract. 1. Introduction
MATCHINGS IN 3-DOMINATION-CRITICAL GRAPHS: A SURVEY by Nawarat Ananchuen * Department of Mathematics Silpaorn University Naorn Pathom, Thailand email: nawarat@su.ac.th Abstract A subset of vertices D of
More informationGraphs. Introduction To Graphs: Exercises. Definitions:
Graphs Eng.Jehad Aldahdooh Introduction To Graphs: Definitions: A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each edge has either one or two vertices associated
More information