# A CHARACTERIZATION OF LOCATING-TOTAL DOMINATION EDGE CRITICAL GRAPHS

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Discussiones Mathematicae Graph Theory 31 (2011) Note A CHARACTERIZATION OF OCATING-TOTA DOMINATION EDGE CRITICA GRAPHS Mostafa Blidia AMDA-RO, Department of Mathematics University of Blida, B.P. 270, Blida, Algeria m and Widad Dali Department R-O University of Algiers, Algeria Abstract For a graph G = (V,E) without isolated vertices, a subset D of vertices of V is a total dominating set (TDS) of G if every vertex in V is adjacent to a vertex in D. The total domination number γ t (G) is the minimum cardinality of a TDS of G. A subset D of V which is a total dominating set, is a locating-total dominating set, or just a TDS of G, if for any two distinct vertices u and v of V(G) \ D, N G (u) D N G (v) D. The locating-totaldomination number γ t(g) is the minimum cardinality of a locating-total dominating set of G. A graph G is said to be a locating-total domination edge removal critical graph, or just a γ t+ -ER-critical graph, if γt (G e) > γt (G) for all e non-pendant edge of E. The purpose of this paper is to characterize the class of γ t+ -ER-critical graphs. Keywords: locating-domination, critical graph Mathematics Subject Classification: 05C69, 05C15.

2 198 M. Blidia and W. Dali 1. Introduction Various types of criticality with respect to domination parameters (such as vertex and edge removal, vertex and edge addition) have been studied see for example [2] for surveys and references. In this paper we investigate graphs which are critical upon edge removal with respect to the locating total domination number. Unless stated otherwise we follow the notation and terminology of [2]. Specifically, N G (v) = {u V(G) uv E(G)} and N G [v] = N G (v) {v} denoted the open and closed neighborhood, respectively, of a vertex v of a graph G = (V(G),E(G)). A vertex of degree one is called a pendant vertex (or a leaf) and its neighbor is called a support vertex. We denote by S(G) (resp. (G)) the set of support vertices (resp. leaves) of G and by v (G) the set of leaves adjacent to a support vertex v. A support vertex v is strong (respectively, weak) if v 2 (respectively, v = 1). An edge incident with a leaf is called a pendant edge. We call the core of G the subset C(G) = V(G) \ (S(G) (G)). The subgraph induced in G by a subset of vertices S is denoted G[S]. A subset S is an independent set if no edge exists between any two vertices of G[S]. We denote by K 1,p, p 1 a star. Recall that a galaxy is a forest in which each component is a star, that is, every edge of a galaxy is a pendant edge. If confusion is unlikely we omit the (G) from the above notation. For a graph G = (V,E) without isolated vertices, a subset D of vertices of V is atotal dominating set (TDS)of G if every vertex inv is adjacent to a vertex in D. The total domination number γ t (G) is the minimum cardinality of atdsofg. A subsetd ofv whichisatdsisalocating-total dominating set, or just a TDS of G, if for any two distinct vertices u and v of V(G)\D, N G (u) D N G (v) D. Thelocating-total domination number γ t (G) is the minimum cardinality of a TDS of G. Note that locating-total domination was introduced by Haynes, Henning and Howard [4]. By µ(g)-set of G, where µ(g) is a domination parameter, we mean a vertex-set of G realizing µ(g), e.g., a γ t (G)-set of G is a TDS X of G with X = γ t (G). In this paper, we study the effects on increasing the locating-total domination number when an edge is deleted. Such problems have been considered before for some domination parameters. Sumner and Blitch [3] were the first introducing edge critical graphs for domination number. When we remove a non-pendant edge e from a graph G, G e remains

3 A Characterization of ocating-total Domination without isolated vertices, the locating-total domination number can increase, decrease or remain unchanged, e.g., if G is a P 5 then γ t (G) = 3 and γ t(g e) = 4 for all e non-pendant edge of E. If G is a clique K 4 then γ t(g) = 3 and γt (G e) = 2 for all e E. If G is a P 6 then γ t(g) = γ t (G e) = 4 for all e non-pendant edge of E. A graph G is said to be a locating-total domination edge removal critical graph, or just a γ t+ -ER-critical graph, if γt (G e) > γt (G) for all e nonpendant edge of E. Since all edges of a star K 1,p, p 1 are pendant edges, we suppose in the following that the star is γ t+ -ER-critical. The purpose of this paper is to give a descriptive characterization of the class of γ t+ -ER-critical graphs. In a similarly way, we have characterized in [1] the class of γ + -ER-critical graphs. 2. Preliminary Results The following results will be of use throughout the paper. Observation 1. For every graph G, the set S(G) of all support vertices is contained in every γ t (G)-set and for each v S(G), every γt (G)-set contains at least v vertices in {v} v. Proposition 2. If D is a γ t (G)-set of a γt+ -ER-critical graph G = (V,E), then V \D is an independent set. Proof. If an edge e exists in G[V \D], then D is also a TDS of G e. Hence γ t(g e) γt (G), which contradicts that G is a γt+ -ER-critical graph. Proposition 3. If D is a γ t (G)-set of a γt+ -ER-critical graph G = (V,E), then G[D] is a galaxy. P roof. Suppose to the contrary that G[D] is not a galaxy. So, G[D] contains a non-pendant edge e. Since G[D] e is a subgraph without isolated vertices, D is a TDS of G e and γ t(g e) D = γt (G), which contradicts the criticality of G. Definition 4. et H = (V,E) be a connected graph which satisfies the following conditions:

4 200 M. Blidia and W. Dali (1) V = X Y. (2) G[X] is a galaxy and Y is an independent set. (3) For every y in Y and for every nonempty subset X N(y) there exists a unique y Y such that N(y ) = X. (4) If H is different from P 2, then every support vertex x in X verifies N(x) Y. et H be the set of all such graphs. Examples: P 4,P 5 H. For p 1, K 1,p H. If p = 1 then K 1,p = P 2 = G[X] and Y =. Graph of H, black vertices define X and white define Y. Remark 1. et H be a graph in H. By Definition 4 and Observation 1, X is a γ t (H)-set. C(H) is an independent set and x C(H), N(x) Y =. 3. Characterization emma 5. If H H, then H is a γ t+ P roof. By definition of a locating-total domination edge removal critical graph, every star K 1,p,p 1 is a γ t+ et H = (V,E) be a graph in H different from K 1,p,p 1. Delete any non-pendant edge e = xy. Since Y is an independent set (see Definition 4-(2)), we have to consider only two cases. Case 1. x X and y Y.

5 A Characterization of ocating-total Domination By Definition 4-(3), there exists y Y;y y such that N(y)\{x} = N(y ), so X is not a TDS of H e. Now by Observation 1, Remark 1 and since all neighbors of y are support vertices, γ t (H e) X {z} = X +1 = γ t(h)+1, where z is y or y. Hence, H is a γ t+ Case 2. x X and y X. By Remark 1, we have to consider two subcases. Subcase 2.1. x and y be support vertices in H and at least one is a weak support, without loss of generality, let x be a weak support such that (N(x)\{y}) X =. One neighbor of x with x are in every TDS of H e, so by Observation 1 and Definition 4, γ t(h e) X + 1 = γt (H) + 1. Hence, H is a γ t+ Subcase 2.2. y is a support vertex in H and x is a vertex in the core C(H). By Definition 4, N(x) is a set of weak support vertices and (N(y)\ {x}) X =, so X is not a TDS of G e. Now by Observation 1, Remark 1 and Definition 4, γ t(h e) X {y } = X +1 = γ t (H)+1 where y is a vertex adjacent to y. Hence, H is a γ t+ Now, the following theorem characterizes the class of γ + -ER-critical graphs. Theorem 6. A nontrivial connected graph G = (V,E) is a γ t+ -ER-critical graph if and only if G H. Proof. The if part follows from emma 5, so let us prove the only if part. If G = K 1,p,p 1, then G H. et G be a connected γ t+ -ER-critical graph different from K 1,p,p 1. et X be a γ t (G)-set of G. By Proposition 2 and Proposition 3, Y = V \X is an independent set and G[X] is a galaxy. Hence, conditions (1) and (2) of thedefinition 4 areproved. Now, it remains to prove Condition (3) and Condition (4). Proof of Condition (3). For that, let y Y, N(y) = {x 1,...,x k },k 1 and X N(y). We consider the following cases. Case 1. X = k. If k = 1, then X = N(y) = {x 1 } and y is a pendant vertex. As X is a γ t (G)-set of G, y is a unique vertex in Y such that N(y) = X. If k 1, then since X is a γ (G)-set of G, y is the unique vertex in Y such that N(y) = X.

6 202 M. Blidia and W. Dali Case 2. 2 X k 1. et X = {x 1,...,x l } N(y)with l k 1. If l = k 1, then there exists auniquevertex y l Y with N(y l ) = {x 1,...,x l }, for otherwise D is a TDS of G e with e = yv and v N(y) N(y l ) which contradicts that G is a γ t+ We repeat this process for y j Y with N(y j ) = {x 1,...,x j } where l +1 j k 2. Consequently, there exists y l Y with N(w l ) = X. Proof of Condition (4). et x beasupportvertex of G in G[X]. Suppose to the contrary that N(x) Y =. Thus, N[x] X, since G is not a star, there exists a vertex y N(x)\ x. et x be a pendant vertex adjacent to x, X {x } is a TDS smaller than X, a contradiction. Notice that a disconnected graph G is γ t+ -ER-critical graph if and only if each component of G is γ t+ So we have the following result. Corollary 1. A graph G = (V,E) without isolated vertices is γ t+ -ERcritical graph if and only if G is the union of graphs of H. Acknowledgement The authors wish to express their appreciation to the referees for their valuable comments and suggestions in improving the presentation of this paper. References [1] M. Blidia and W. Dali, A characterization of a locating-domination edge critical graphs, Australasian J. Combin. 44 (2009) [2] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998). [3] D.P. Sumner and P. Blitch, Domination critical graphs, J. Combin. Theory (B) 34 (1983) [4] T.W. Haynes, M.A. Henning and J. Howard, ocating and total dominating sets in trees, Discrete Appl. Math. 154 (2006) Received 8 December 2008 Revised 20 December 2009 Accepted 21 January 2010

### BOUNDARY EDGE DOMINATION IN GRAPHS

BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem

Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of fault-tolerant

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH

CHAPTER 3 SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like B-radius

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10

Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

### Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

### Global secure sets of trees and grid-like graphs. Yiu Yu Ho

Global secure sets of trees and grid-like graphs by Yiu Yu Ho B.S. University of Central Florida, 2006 M.S. University of Central Florida, 2010 A dissertation submitted in partial fulfillment of the requirements

### When is a graph planar?

When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1

GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### Types of Degrees in Bipolar Fuzzy Graphs

pplied Mathematical Sciences, Vol. 7, 2013, no. 98, 4857-4866 HIKRI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.37389 Types of Degrees in Bipolar Fuzzy Graphs Basheer hamed Mohideen Department

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

### The Independence Number in Graphs of Maximum Degree Three

The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### An inequality for the group chromatic number of a graph

Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,

### Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### arxiv: v2 [math.co] 30 Nov 2015

PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### Competition Parameters of a Graph

AKCE J. Graphs. Combin., 4, No. 2 (2007), pp. 183-190 Competition Parameters of a Graph Suk J. Seo Computer Science Department Middle Tennessee State University Murfreesboro, TN 37132, U.S.A E-mail: sseo@mtsu.edu

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices

MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Special Classes of Divisor Cordial Graphs

International Mathematical Forum, Vol. 7,, no. 35, 737-749 Special Classes of Divisor Cordial Graphs R. Varatharajan Department of Mathematics, Sri S.R.N.M. College Sattur - 66 3, Tamil Nadu, India varatharajansrnm@gmail.com

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### Balloons, Cut-Edges, Matchings, and Total Domination in Regular Graphs of Odd Degree

Balloons, Cut-Edges, Matchings, and Total Domination in Regular Graphs of Odd Degree Suil O, Douglas B. West November 9, 2008; revised June 2, 2009 Abstract A balloon in a graph G is a maximal 2-edge-connected

### GRAPHS AND ZERO-DIVISORS. In an algebra class, one uses the zero-factor property to solve polynomial equations.

GRAPHS AND ZERO-DIVISORS M. AXTELL AND J. STICKLES In an algebra class, one uses the zero-factor property to solve polynomial equations. For example, consider the equation x 2 = x. Rewriting it as x (x

### Discrete Applied Mathematics. The firefighter problem with more than one firefighter on trees

Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### Degree-associated reconstruction parameters of complete multipartite graphs and their complements

Degree-associated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertex-deleted subgraphofagraphgisacard.

### Kings in Tournaments. Yu Yibo, Di Junwei, Lin Min

Kings in Tournaments by Yu Yibo, i Junwei, Lin Min ABSTRACT. Landau, a mathematical biologist, showed in 1953 that any tournament T always contains a king. A king, however, may not exist. in the. resulting

### On Some Vertex Degree Based Graph Invariants

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (20) 723-730 ISSN 0340-6253 On Some Vertex Degree Based Graph Invariants Batmend Horoldagva a and Ivan

### High degree graphs contain large-star factors

High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a

### 3. Eulerian and Hamiltonian Graphs

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

### Extremal Wiener Index of Trees with All Degrees Odd

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS

A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS PAWE L PRA LAT Abstract. In this note we consider the on-line Ramsey numbers R(P n, P m ) for paths. Using a high performance computing clusters,

### Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

### On the maximum average degree and the incidence chromatic number of a graph

Discrete Mathematics and Theoretical Computer Science DMTCS ol. 7, 2005, 203 216 On the maximum aerage degree and the incidence chromatic number of a graph Mohammad Hosseini Dolama 1 and Eric Sopena 2

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

### A Study of Sufficient Conditions for Hamiltonian Cycles

DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 Cristina Bazgan a and Zsolt Tuza b,c,d a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, F-75775 Paris

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

### 1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

### FIXED POINT SETS OF FIBER-PRESERVING MAPS

FIXED POINT SETS OF FIBER-PRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 e-mail: rfb@math.ucla.edu Christina L. Soderlund Department of Mathematics

### UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

### Graph theoretic techniques in the analysis of uniquely localizable sensor networks

Graph theoretic techniques in the analysis of uniquely localizable sensor networks Bill Jackson 1 and Tibor Jordán 2 ABSTRACT In the network localization problem the goal is to determine the location of

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### Irreducible Divisor Graphs

Irreducible Divisor Graphs Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND 58105-5075 Jack Maney Department of Mathematical Sciences The University of South Dakota 414

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska

Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four

### Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

### COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Cycle transversals in bounded degree graphs

Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms. Dissertation

Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms Dissertation zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr.-Ing.) der Fakultät für Informatik und Elektrotechnik

### Linear Algebra and its Applications

Linear Algebra and its Applications 438 2013) 1393 1397 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Note on the

### Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

### Distributed Computing over Communication Networks: Maximal Independent Set

Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.

### Tilings of the sphere with right triangles III: the asymptotically obtuse families

Tilings of the sphere with right triangles III: the asymptotically obtuse families Robert J. MacG. Dawson Department of Mathematics and Computing Science Saint Mary s University Halifax, Nova Scotia, Canada

### Crossing the Bridge at Night

A1:01 Crossing the Bridge at Night Günter Rote Freie Universität Berlin, Institut für Informatik Takustraße 9, D-14195 Berlin, Germany rote@inf.fu-berlin.de A1:02 August 21, 2002 A1:03 A1:04 Abstract We

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### The tree-number and determinant expansions (Biggs 6-7)

The tree-number and determinant expansions (Biggs 6-7) André Schumacher March 20, 2006 Overview Biggs 6-7 [1] The tree-number κ(γ) κ(γ) and the Laplacian matrix The σ function Elementary (sub)graphs Coefficients

### Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles

Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles Venkatesh Raman and Saket Saurabh The Institute of Mathematical Sciences, Chennai 600 113. {vraman

### Graph Security Testing

JOURNAL OF APPLIED COMPUTER SCIENCE Vol. 23 No. 1 (2015), pp. 29-45 Graph Security Testing Tomasz Gieniusz 1, Robert Lewoń 1, Michał Małafiejski 1 1 Gdańsk University of Technology, Poland Department of

### Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### Minimum-Density Identifying Codes in Square Grids

Minimum-Density Identifying Codes in Square Grids Marwane Bouznif, Frédéric Havet, Myriam Preissmann To cite this version: Marwane Bouznif, Frédéric Havet, Myriam Preissmann. Minimum-Density Identifying

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

### 5 Directed acyclic graphs

5 Directed acyclic graphs (5.1) Introduction In many statistical studies we have prior knowledge about a temporal or causal ordering of the variables. In this chapter we will use directed graphs to incorporate

### On 2-vertex-connected orientations of graphs

On 2-vertex-connected orientations of graphs Zoltán Szigeti Laboratoire G-SCOP INP Grenoble, France 12 January 2012 Joint work with : Joseph Cheriyan (Waterloo) and Olivier Durand de Gevigney (Grenoble)