On Sequential Topogenic Graphs
|
|
- Cecily Roberts
- 5 years ago
- Views:
Transcription
1 Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary Matha Arts & Science College Vemom P.O., Mananthavady , India bindhukthomas@gmail.com srgerminaka@gmail.com jishaelizabathjoy@gmail.com Abstract Given any simple graph G =(V,E), not necessarily finite, and a ground set X, a set-valued function f : V 2 X is a set-indexer of G if f is injective and the induced edge function f L : E(G) 2 X, defined by f L (uv) =(f(u) f(v)) (f(v) f(u) for each uv E, is also injective. A set-indexer f of G is called a segregation of X on G if the sets {f(u) :u V (G)} and {f L (e) :e E(G)} are disjoint and if, in addition their union is the set Y (X) =τ for some topology τ on X, then f is called a sequential topogenic labeling of G. A graph is called sequential topogenic if it admits a sequential topogenic labeling with respect to some set X. In this paper we initiate an investigation on sequential topogenic labeling of a graph. Keywords: sequential topogenic labeling, sequential topogenic graphs, sequential topogenic index 1 Introduction For all terminology and notation in graph theory, not specifically defined in this paper, we refer the reader to the text-book by F. Harary [6]. Unless mentioned otherwise, all graphs considered in this paper are simple and selfloop-free. For a (p, q)-graph G =(V,E) and a nonempty set X of cardinality n, Acharya [1] defined a set-indexer of G as an injective set-valued (or, equivalently, setlabeling ) function f : V (G) 2 X such that the induced edge-function f L : E(G) 2 X defined by f L (uv) =f(u) f(v) for all uv E(G) is also injective, where 2 X is the set of all subsets of X and denotes the binary operation of taking the symmetric difference of pairs of subsets of X. He defined G to be set-sequential if G admits a set-sequential labeling, which
2 1800 B. K. Thomas, K. A. Germina and J. E. Joy is a bijection f : V E 2 X such that f(uv) =f(u) f(v) for all uv E(G). The notion of topogenic set-indexer is defined as a set-indexer f such that f(v ) f L (E) is a topology on X. A wide discussion of topogenic labeling and topogenic graphs have been done in [3], [4] and [5]. As a generalization of the notion of set-sequential labeling we define the sequential topogenic labeling as follows. Definition 1.1. Let G =(V,E) be any graph and X be any set. A setindexer L f of G is called a segregation of X on G if the sets {f(u) :u V (G)} and {f (e) :e E(G)} are disjoint and if, in addition their union is the set Y (X) =τ for some topology τ on X, then f is called a sequential topogenic labeling of G. A graph is called sequential topogenic if it admits a sequential topogenic labeling with respect to some set X. 2 Preliminary Analysis Observation 2.1. then, / f(v E). If f :(V E) 2 X is a sequential topogenic labeling Proof. If f(u) = for some u V (G), then for any edge x = uv, we have f(x) =f(v), a contradiction to the injectivity of f. On the other hand if f(x) = for some x = uv E(G), then = f(u) f(v) which is true if and only if f(u) =f(v). This again leads to a contradiction to the injectivity of f. Remark 2.2. Due to the absence of in f(v ) f(e) a sequential topogenic labeling f can never be a topogenic labeling. Since f(v ), a topogenic labeling f can never be a sequential topogenic labeling. Observation 2.3. Every set-sequential graphs are sequential topogenic. Proof. Let G =(V,E) be a set-sequential graph. Then there exists a bijection f :(V E) 2 X for some set X. Now, f(v E) =2 X, the discrete topology on X. Observation 2.4. A sequential topogenic graph need not be set-sequential as C 4 which is not set-sequential is sequential topogenic by assigning the sets {1}, {3}, {1, 2}, {3, 4} to the vertices v 1,v 2,v 3,v 4 respectively. 3 Sequential Topogenic Graphs The concepts of topogenic graphs and sequential topogenic graphs are closely related. Hence we recall some results from [3] which are useful in this paper.
3 On sequential topogenic graphs 1801 Theorem 3.1. [3] The complete graph K p is topogenic for p {1, 2, 3, 6}. Theorem 3.2. [3] K 4,K 5 are not topogenic. Theorem 3.3. [3] K 1,m,n is topogenic for any m, n. Conjecture 3.4. [3] {1, 2, 3, 6}. The complete graph K n is topogenic if and only if n Remark 3.5. The path P 2 is sequential topogenic with the labeling f(u 1 )= {1},f(u 2 )={2} where u 1,u 2 V (P 2 ) and P 3 is sequential topogenic with the labeling f(u 1 )={1},f(u 2 )={2},f(u 3 )={1, 3} where u 1,u 2,u 3 V (P 3 ). But in general paths are not sequential topogenic. Theorem 3.6. P 4 is not sequential topogenic. Proof. If possible let P 4 be sequential topogenic with respect to a nonempty set X. Then there exists a sequential topogenic set-indexer f such that f(v E) =τ for some topology τ on X. Let f(v )={A 1,A 2,A 3,A 4 }. Then, f(e) ={A 1 A2,A 2 A3,A 3 A4 }. Clearly, X f(v E). Then, there arises two cases viz., X = A i for some i or X = A i Aj for some i, j. Case 1: X = A i for some i. Then, X is the assignment of either a pendant vertex or an internal vertex. (i) Without loss of generality, let X = A 1. Then, A 2,A 3,A 4 can be such that A 2 A 3 A 4 = A 1 or A 2 A 3 A 4 A 1. If A 2 A 3 A 4 = A 1, then A 2,A 3,A 4 cannot be mutually disjoint, if so then A 1 A2 = A 2 A3. Hence, at least two of them must have a nonempty intersection. Without loss of generality, let A 2 A 4. But, A 2 A 4 / f(v E) asa 2 A 4 A i for any i [ since if A 2 A 4 = A 2 or A 4, then (A 2 A3 ) (A 3 A4 ) / f(v E). Now, A 2 A 4 = A 3 = A 2 = A 3 T 1,A 4 = A 3 T 2, where T 1,T 2 are nonempty subsets of X. Then, (A 2 A3 ) (A 4 A3 )=T 1 T 2 / f(v E).] and A 2 A 4 A i Aj, for distinct i, j {1, 2, 3, 4} [since if A 2 A 4 = A 2 A3 = A 3 = A 2 (A 2 A 4 )= A 3 A 2 and A 3 A 4 = = A 3 A4 = A 1. Similar contradiction arises when A 2 A 4 = A 3 A4.] Therefore, A 2 A 3 A 4 A 1. As seen before A 2,A 3,A 4 cannot be mutually disjoint. Hence at least two of them must have a nonempty intersection. If adjacent labelings A 2,A 3 have nonempty intersection, then A 2 A 3 must be in f(v E). Proceeding as before we get that, A 2 A 3 A i for any i and A 2 A 3 A i Aj, a contradiction to our assumption. In a similar manner we can show that if nonadjacent labelings A 2,A 4 have nonempty intersection, then A 2 A 4 / f(v E). Proceeding as before we can prove that X is not an assignment of any internal vertices. Thus we have X/ f(v ). Case 2: Let X = A i Aj for some i, j. Then, without loss of generality, (a) X = A 1 A2 or (b) X = A 2 A3.
4 1802 B. K. Thomas, K. A. Germina and J. E. Joy (a) If X = A 1 A2, then A 1 A 2 = X and A 1 A 2 =. Then A 3 and A 4 should be subsets of A 1 or A 2 or contains elements from both A 1 and A 2. (i) If A 3 A 1 and A 4 A 1, then A 3 A 2 = A 4 A 2 =. Therefore, A 2 A 4 / f(v E). (ii) If A 3 A 1 and A 4 A 2, then A 1 A 4 / f(v E). (iii) If A 3 A 1 and A 4 A 1,A 4 A 2, then A 1 A 4 / f(v E). (iv) If A 3 A 1,A 3 A 2,A 4 A 1 and A 4 A 2, then A 1 A 3 / f(v E). Similar contradiction arises for all other choices of X and A i, where i {1, 2, 3, 4}. Therefore, X / f(e). Hence X / f(v E) and the results follows by contraposition. Theorem 3.7. A graph G =(V,E) is sequential topogenic if and only if G + K 1, V (K 1 )={v} has a topogenic labeling F such that F (v) =. Proof. Let G =(V,E) be sequential topogenic. Then, there exists a sequential topogenic set-indexer f such that f(v E) =τ for some topology τ on X. Let G = G + K 1. Define F as an extension of f such that F (u) =f(u) for all u V (G) and F (v) =. Clearly, F is a topogenic set-indexer. Conversely if G = G+K 1, has a topogenic labeling F with F (v) =, then the removal of v from G obviously results in a sequential topogenic labeling. Since K 4,K 5 are not topogenic K 3 and K 4 are not sequen- Corollary 3.8. Corollary 3.9. topogenic. Remark tial topogenic. K 5 is sequential topogenic since K 6 = K 5 +K 1 is topogenic. K m,n is sequential topogenic since K 1,m,n = K m,n + K 1 is Remark The complete graph K 1 is sequential topogenic with any non-empty set assigned to its only one vertex and K 2 is sequential topogenic by Remark 3.5. By invoking Conjecture 3.4 and Theorem 3.7 we strongly believe that the only sequential topogenic complete graphs are K 1,K 2 and K 5. Thus, we conjectured the following. Conjecture The complete graph K n is sequential topogenic if and only if n {1, 2, 5}. 4 Sequential Topogenic Index Definition 4.1. The sequential topogenic index γ(g) of a graph G is the least cardinality of a set X with respect to which G has a sequential topogenic labeling. Further, if f : V E 2 X is a sequential topogenic labeling of G with X = γ(g) we call f an optimal sequential topogenic labeling of G.
5 On sequential topogenic graphs 1803 Lemma 4.2. q +1). For any sequential topogenic (p, q)-graph G, γ(g) log 2 (p+ Proof. Let G be a sequential topogenic (p, q)-graph with respect to a set X. Then, 1 p + q 2 X 1= p + q 2 X 1= p + q +1 2 X = log 2 (p + q +1) X. Thus, we have γ(g) log 2 (p + q +1). Remark 4.3. p + q forms an upper bound for γ(g). Theorem 4.4. For a complete bipartite graph K m,n, log 2 ((m + 1)(n + 1)) γ(k m,n ) m + n Proof. The result follows from Lemma 4.2 and Theorem 3.7. Remark 4.5. We have the sequential topogenic index γ(k 1 )=1, γ(k 2 )= 2. From Lemma 4.2 we have γ(k 5 ) 4. But, K 5 is sequential topogenic by assigning the sets {1, 2, 3}, {1, 2, 4}, {1, 3, 4}, {2, 3, 4}, {1, 2, 3, 4} to the vertices v 1,v 2,v 3,v 4,v 5 respectively. Therefore, γ(k 5 )=4. 5 Embedding and NP-Completeness A graph G is said to be embedded in a graph H, written G H, if there exists an induced subgraph G of H such that G is isomorphic to G (written, G = G ); then we call H a host of G. Theorem 5.1. Every (p, q)-graph G can be embedded into a connected sequential topogenic graph. Proof. Let G be a (p, q)-graph and V (G) ={u 1,u 2,...,u p }. Case I: Let G has at least one pendant vertex say u p. Let X = {1, 2,...,p} and X = {1, 2,...,p 1}. Label u i by the singleton set {i}, where 1 i p 1 and u p by X. Define S j as the subsets of X of cardinality j which contains the element 1. If u i is not adjacent to u j where i, j 1,p introduce a new vertex, label it by {1,i,j} and join it to u 1. If u 1 is not adjacent to u k, introduce a vertex, label it by {1, 2,k} and join to the vertex u 2 [if{1, 2,k} f(v ), then join that vertex to u 2 ]. Now introduce S 4 + S S n new vertices and label them by the elements of S 4,S 5,...,S n in an injective manner. The subsets of cardinality three which was not a vertex label is obtained as edge labels by joining the vertices which was labeled by elements of S 4 to u 1 and appropriate elements of S 4 to u i, 1 i p 1 as required. Then join the vertices which was labeled by the elements of S 5,S 6,...S n to u 1. The resulting graph is sequential topogenic. Case II: If G has no pendant vertex, attach a pendant vertex u p+1 to u 1 and take X = {1, 2,...p+1} and X = {1, 2,...p}. Then proceed as in Case I.
6 1804 B. K. Thomas, K. A. Germina and J. E. Joy Corollary 5.2. Let G be any (p, q)-graph and H be its sequential topogenic host. Then, the chromatic number χ(h) =χ(g) +1 and the clique number ω(h) is either ω(g) or ω(g) +1. If the chromatic number and the clique number of G are greater than or equal to three then so is that of H. Therefore, the problems of determining the chromatic number and clique number of a connected sequential topogenic graph is NP- Complete. Remark 5.3. We have shown that every graph G has a sequential topogenic host H, in the sense that G is contained as an induced subgraph in H which is sequential topogenic, implying there by that there is no forbidden subgraph characterization of sequential topogenic graphs. 6 Conclusion and scope Characterizing sequential topogenic graphs in general is a challenging problem. Finding good bounds for γ(g) for a sequential topogenic graph is also seems to be a challenging problem. Acknowledgements The authors are thankful to the Department of Science & Technology, Government of India for supporting this research under the Project No. SR/S4/MS:277/06. References [1] B.D. Acharya, Set-valuations of graphs and their applications, MRI Lecture Notes in Applied Mathematics, No.2, Mehta Research Institute of Mathematics and Mathematical Physics, Allahabad, [2] B.D. Acharya, S. M. Hegde Set-sequential graphs, Nat. Acad. Sci. Letters, 8(12): , [3] K.A. Germina, Jisha Elizabath Joy, Topogenic graphs, Submitted. [4] K.A. Germina, Jisha Eizabath Joy, Topogenic graphs II: Embedding,Indian Journal of Mathematics, 51(3), , 2009 [5] K.A. Germina, Jisha Elizabath Joy, Enumeration of Graphical Realization, International Journal of Algorithm, Computing and Mathematics, 3(1),31-46,2010.
7 On sequential topogenic graphs 1805 [6] F. Harary, Graph Theory, Addison-Wesley Pub. Comp., Reading, Massachusetts, Received: March, 2010
A Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs
Applied Mathematics E-Notes, 15(015), 9-37 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ A Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs Naduvath
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 informationTopological Integer Additive Set-Sequential Graphs. Received: 7 April 2015 / Accepted: 26 June 2015 / Published: 3 July 2015
Mathematics 2015, 3, 604-614; doi:10.3390/math3030604 OPEN ACCESS mathematics ISSN 2227-7390 www.mdpi.com/journal/mathematics Article Topological Integer Additive Set-Sequential Graphs Sudev Naduvath 1,
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 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 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 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 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 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 informationChapter 4. Triangular Sum Labeling
Chapter 4 Triangular Sum Labeling 32 Chapter 4. Triangular Sum Graphs 33 4.1 Introduction This chapter is focused on triangular sum labeling of graphs. As every graph is not a triangular sum graph it is
More informationVertex Minimal and Common Minimal Equitable Dominating Graphs
Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 10, 499-505 Vertex Minimal and Common Minimal Equitable Dominating Graphs G. Deepak a, N. D. Soner b and Anwar Alwardi b a Department of Mathematics The
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 information[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH S. Sethu Ramalingam * 1, I. Keerthi Asir 2 and S. Athisayanathan 3 *1,2 & 3 Department of Mathematics,
More informationAbstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.
Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph
More informationPAijpam.eu TOTAL CO-INDEPENDENT DOMINATION OF JUMP GRAPH
International Journal of Pure and Applied Mathematics Volume 110 No. 1 2016, 43-48 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v110i1.4
More informationEdge Graceful Labeling of Some Trees
Global Journal of Mathematical Sciences: Theory and Practical. olume, Number (0), pp. - International Research Publication House http://www.irphouse.com Edge Graceful Labeling of Some Trees B. Gayathri
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 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 informationNetwork flows and Menger s theorem
Network flows and Menger s theorem Recall... Theorem (max flow, min cut strong duality). Let G be a network. The maximum value of a flow equals the minimum capacity of a cut. We prove this strong duality
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 informationRoman Domination in Complementary Prism Graphs
International J.Math. Combin. Vol.2(2012), 24-31 Roman Domination in Complementary Prism Graphs B.Chaluvaraju and V.Chaitra 1(Department of Mathematics, Bangalore University, Central College Campus, Bangalore
More informationOn the Rainbow Neighbourhood Number of Set-Graphs
On the Rainbow Neighbourhood Number of Set-Graphs Johan Kok, Sudev Naduvath arxiv:1712.02324v1 [math.gm] 6 Dec 2017 Centre for Studies in Discrete Mathematics Vidya Academy of Science & Technology Thalakkottukara,
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 informationPreimages of Small Geometric Cycles
Preimages of Small Geometric Cycles Sally Cockburn Department of Mathematics Hamilton College, Clinton, NY scockbur@hamilton.edu Abstract A graph G is a homomorphic preimage of another graph H, or equivalently
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 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 informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
More informationVertex 3-colorability of claw-free graphs
Algorithmic Operations Research Vol.2 (27) 5 2 Vertex 3-colorability of claw-free graphs Marcin Kamiński a Vadim Lozin a a RUTCOR - Rutgers University Center for Operations Research, 64 Bartholomew Road,
More informationBipartite Roots of Graphs
Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only
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 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 informationSquare Sum Graph Associated with a Sequence of Positive Integers
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn:2319-765x. Volume 10, Issue 1 Ver. II. (Feb. 2014), PP 66-70 Square Sum Graph Associated with a Sequence of Positive Integers Reena Sebastian
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 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 informationA note on isolate domination
Electronic Journal of Graph Theory and Applications 4 (1) (016), 94 100 A note on isolate domination I. Sahul Hamid a, S. Balamurugan b, A. Navaneethakrishnan c a Department of Mathematics, The Madura
More informationVariation of Graceful Labeling on Disjoint Union of two Subdivided Shell Graphs
Annals of Pure and Applied Mathematics Vol. 8, No., 014, 19-5 ISSN: 79-087X (P), 79-0888(online) Published on 17 December 014 www.researchmathsci.org Annals of Variation of Graceful Labeling on Disjoint
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 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 informationCHARACTERIZING SYMMETRIC DIAMETRICAL GRAPHS OF ORDER 12 AND DIAMETER 4
IJMMS 30:3 (2002) 145 149 PII. S0161171202012474 http://ijmms.hindawi.com Hindawi Publishing Corp. CHARACTERIZING SYMMETRIC DIAMETRICAL GRAPHS OF ORDER 12 AND DIAMETER 4 S. AL-ADDASI and H. Al-EZEH Received
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 informationON LICT SIGRAPHS. Communicated by Dariush Kiani
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 4 (2014), pp. 11-18. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir ON LICT SIGRAPHS V. MATHAD
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 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 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 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 informationVertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada
More informationMonophonic Chromatic Parameter in a Connected Graph
International Journal of Mathematical Analysis Vol. 11, 2017, no. 19, 911-920 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.78114 Monophonic Chromatic Parameter in a Connected Graph M.
More informationColouring graphs with no odd holes
Colouring graphs with no odd holes Paul Seymour (Princeton) joint with Alex Scott (Oxford) 1 / 17 Chromatic number χ(g): minimum number of colours needed to colour G. 2 / 17 Chromatic number χ(g): minimum
More informationDomination Number of Jump Graph
International Mathematical Forum, Vol. 8, 013, no. 16, 753-758 HIKARI Ltd, www.m-hikari.com Domination Number of Jump Graph Y. B. Maralabhavi Department of Mathematics Bangalore University Bangalore-560001,
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 informationThe Connectivity and Diameter of Second Order Circuit Graphs of Matroids
Graphs and Combinatorics (2012) 28:737 742 DOI 10.1007/s00373-011-1074-6 ORIGINAL PAPER The Connectivity and Diameter of Second Order Circuit Graphs of Matroids Jinquan Xu Ping Li Hong-Jian Lai Received:
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationarxiv: v1 [math.co] 4 Apr 2011
arxiv:1104.0510v1 [math.co] 4 Apr 2011 Minimal non-extensible precolorings and implicit-relations José Antonio Martín H. Abstract. In this paper I study a variant of the general vertex coloring problem
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 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 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 informationPrime Labeling for Some Planter Related Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 8, Number 3 (2016), pp. 221-231 International Research Publication House http://www.irphouse.com Prime Labeling for Some Planter Related
More informationOperations in Fuzzy Labeling Graph through Matching and Complete Matching
Operations in Fuzzy Labeling Graph through Matching and Complete Matching S. Yahya Mohamad 1 and S.Suganthi 2 1 PG & Research Department of Mathematics, Government Arts College, Trichy 620 022, Tamilnadu,
More informationON HARMONIOUS COLORINGS OF REGULAR DIGRAPHS 1
Volume 1 Issue 1 July 015 Discrete Applied Mathematics 180 (015) ON HARMONIOUS COLORINGS OF REGULAR DIGRAPHS 1 AUTHORS INFO S.M.Hegde * and Lolita Priya Castelino Department of Mathematical and Computational
More informationMath 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem
Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem David Glickenstein November 26, 2008 1 Graph minors Let s revisit some de nitions. Let G = (V; E) be a graph. De nition 1 Removing
More informationClaw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version.
Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Part I. Basic graphs Maria Chudnovsky Department of Industrial Engineering and Operations Research Columbia University,
More informationBinding Number of Some Special Classes of Trees
International J.Math. Combin. Vol.(206), 76-8 Binding Number of Some Special Classes of Trees B.Chaluvaraju, H.S.Boregowda 2 and S.Kumbinarsaiah 3 Department of Mathematics, Bangalore University, Janana
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 informationTotal magic cordial labeling and square sum total magic cordial labeling in extended duplicate graph of triangular snake
2016; 2(4): 238-242 ISSN Print: 2394-7500 ISSN Online: 2394-5869 Impact Factor: 5.2 IJAR 2016; 2(4): 238-242 www.allresearchjournal.com Received: 28-02-2016 Accepted: 29-03-2016 B Selvam K Thirusangu P
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 informationA generalization of Mader s theorem
A generalization of Mader s theorem Ajit A. Diwan Department of Computer Science and Engineering Indian Institute of Technology, Bombay Mumbai, 4000076, India. email: aad@cse.iitb.ac.in 18 June 2007 Abstract
More informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
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 informationAn Investigation of the Planarity Condition of Grötzsch s Theorem
Le Chen An Investigation of the Planarity Condition of Grötzsch s Theorem The University of Chicago: VIGRE REU 2007 July 16, 2007 Abstract The idea for this paper originated from Professor László Babai
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 informationDiscrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs
Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More informationDirac-type characterizations of graphs without long chordless cycles
Dirac-type characterizations of graphs without long chordless cycles Vašek Chvátal Department of Computer Science Rutgers University chvatal@cs.rutgers.edu Irena Rusu LIFO Université de Orléans irusu@lifo.univ-orleans.fr
More informationCharacterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
ISSN 0975-3303 Mapana J Sci, 11, 4(2012), 121-131 https://doi.org/10.12725/mjs.23.10 Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs R Mary Jeya Jothi * and A Amutha
More informationVertex coloring, chromatic number
Vertex coloring, chromatic number A k-coloring of a graph G is a labeling f : V (G) S, where S = k. The labels are called colors; the vertices of one color form a color class. A k-coloring is proper if
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 informationA generalization of zero divisor graphs associated to commutative rings
Proc. Indian Acad. Sci. (Math. Sci.) (2018) 128:9 https://doi.org/10.1007/s12044-018-0389-0 A generalization of zero divisor graphs associated to commutative rings M. AFKHAMI 1, A. ERFANIAN 2,, K. KHASHYARMANESH
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 informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationCharacterizations of graph classes by forbidden configurations
Characterizations of graph classes by forbidden configurations Zdeněk Dvořák September 14, 2015 We consider graph classes that can be described by excluding some fixed configurations. Let us give some
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 informationNim-Regularity of Graphs
Nim-Regularity of Graphs Nathan Reading School of Mathematics, University of Minnesota Minneapolis, MN 55455 reading@math.umn.edu Submitted: November 24, 1998; Accepted: January 22, 1999 Abstract. Ehrenborg
More informationBijective Proofs of Two Broken Circuit Theorems
Bijective Proofs of Two Broken Circuit Theorems Andreas Blass PENNSYLVANIA STATE UNIVERSITY UNIVERSITY PARK, PENNSYLVANIA 16802 Bruce Eli Sagan THE UNIVERSITY OF PENNSYLVANIA PHILADELPHIA, PENNSYLVANIA
More informationSome bounds on chromatic number of NI graphs
International Journal of Mathematics and Soft Computing Vol.2, No.2. (2012), 79 83. ISSN 2249 3328 Some bounds on chromatic number of NI graphs Selvam Avadayappan Department of Mathematics, V.H.N.S.N.College,
More informationTHE SEMIENTIRE DOMINATING GRAPH
Advances in Domination Theory I, ed VR Kulli Vishwa International Publications (2012) 63-70 THE SEMIENTIRE DOMINATING GRAPH VRKulli Department of Mathematics Gulbarga University, Gulbarga - 585 106, India
More informationVertex coloring, chromatic number
Vertex coloring, chromatic number A k-coloring of a graph G is a labeling f : V (G) S, where S = k. The labels are called colors; the vertices of one color form a color class. A k-coloring is proper if
More informationCMSC Honors Discrete Mathematics
CMSC 27130 Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Justin Lubin The University of Chicago, Autumn 2017 1 Contents I Number Theory 4 1 The Euclidean Algorithm 4 2 Mathematical
More informationLecture 6: Graph Properties
Lecture 6: Graph Properties Rajat Mittal IIT Kanpur In this section, we will look at some of the combinatorial properties of graphs. Initially we will discuss independent sets. The bulk of the content
More informationSmarandache Directionally n-signed Graphs A Survey
International J.Math. Combin. Vol.2(2013), 34-43 Smarandache Directionally n-signed Graphs A Survey P.Siva Kota Reddy (Department of Mathematics, Acharya Institute of Technology, Soladevanahalli, Bangalore-560
More informationSymmetric Product Graphs
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 5-20-2015 Symmetric Product Graphs Evan Witz Follow this and additional works at: http://scholarworks.rit.edu/theses
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 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 informationTriple Domination Number and it s Chromatic Number of Graphs
Triple Domination Number and it s Chromatic Number of Graphs A.Nellai Murugan 1 Assoc. Prof. of Mathematics, V.O.Chidambaram, College, Thoothukudi-628 008, Tamilnadu, India anellai.vocc@gmail.com G.Victor
More informationThe Cover Pebbling Number of the Join of Some Graphs
Applied Mathematical Sciences, Vol 8, 2014, no 86, 4275-4283 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ams201445377 The Cover Pebbling Number of the Join of Some Graphs Michael E Subido and Imelda
More informationHeronian Mean Labeling of Graphs
International Mathematical Forum, Vol. 12, 2017, no. 15, 705-713 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.68108 Heronian Mean Labeling of Graphs S.S. Sandhya Department of Mathematics
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 informationCollapsible biclaw-free graphs
Collapsible biclaw-free graphs Hong-Jian Lai, Xiangjuan Yao February 24, 2006 Abstract A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected
More informationConstructions of k-critical P 5 -free graphs
1 2 Constructions of k-critical P 5 -free graphs Chính T. Hoàng Brian Moore Daniel Recoskie Joe Sawada Martin Vatshelle 3 January 2, 2013 4 5 6 7 8 Abstract With respect to a class C of graphs, a graph
More information