DOCSLIB.ORG

Note a Note on Hamiltonian Split Graphs Split Graphs Were Introduced in [3] Where It Was Shown That These Graphs Have a Simple C

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Note a Note on Hamiltonian Split Graphs Split Graphs Were Introduced in [3] Where It Was Shown That These Graphs Have a Simple C View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF COMBINATORIAL THEORY, Series B 28, 245-248 (1980) Note A Note on Hamiltonian Split Graphs RAINER E. BURKARD Mathematical Institute, University of Cologne, Cologne, Federal Republic of Germany PETER L. HAMMER Department of Combinatorics and Optimization, University of Waterloo, Waterloo (Ontario), Canada Received November 16, 1978 A necessary condition for the existence of a Hamiltonian cycle in split graphs is proved. Split graphs were introduced in [3] where it was shown that these graphs have a simple characterization by means of forbidden subgraphs. Let I and K be two sets. P,(I, K) denotes the set of all sets of cardinality 2 with one element from I and the other element from K. A graph G = (V; E) is a split graph, if the vertex set V is the union of two disjoint, finite and nonempty sets I and K and the edge set E partitions in sets E1 , Ez with El = P,(K, K) and E, _CP&I, K). Split graphs are strongly related to bipartite graphs (i.e., graphs with El = 0). If 1 Z 1 = 1 K 1 then the split graph (I, K; El , Es) has a Hamiltonian cycle if and only if the bipartite graph (Z, K; 0, E,) has one. Since no Hamiltonian cycle exists if 1 K 1 < 1 I I, we can concentrate here on the remaining case We shall derive below a necessary condition for the existence of a Hamilton- ian cycle in this case. Let S C I and let N(S) = {y E K I 3x E S:{x, y} E Es} be the set of neighbors of s. 245 009%8956/80/020245-04$02.00/0 Copyright 0 1980 by Academic Press, Inc. All rights of reproduction in any form reserved. 246 BURKARD AND HAMMER LEMMA. Let G be a split graph with 1K 1 > 1Z 1. Zf there exists a set S C Z with 1S 1 > 1N(S)/, then there is no Hamiltonian cycle in G. Proof. Let us assume there is a Hamiltonian cycle in G. Then it must use two vertices of N(S) for each x E S. But then the bipartite subgraph, induced by the vertices of S and of N(S), contains a proper subcycle. This is a contra- diction. Q.E.D. Now let I’ 2 Z, K’ C K and let G’ = (I’, K’; &) be the induced bipartite subgraph. EL contains therefore those edges of Ez which are incident with vertices of Z’ and K’. A component of G’ is a connected component with respect to edges of Z$ . We call a component G0 = (Z*, KO; E,Q) deficient, if ) I“ 1 > 1Kp I. The de$ciency kp of a component GP is then defined by kp: = 1Zp 1 - 1K” 1, if IZ”I > IKpI, = 0, otherwise. The deficiency of the bipartite graph G’ with r components is the sum of the deficiencies of its components k(G):= i kp. D=l Further a component is called critical, if ) I* 1 = ] Kp I holds. Now we get the following theorem: THEOREM. Let G be a split graph with I Z I < I K I. Let S be an arbitrary subset of Z, let T be an arbitrary subset of N(S), and let h be the number of critical components of the induced bipartite graph G’ : = (S, N(S)\T, Ei). Further let k(G’) be the deficiency of G’. If G is Hamiltonian and (h, k) # (0, 0), then 1 + max(1, h) k+[ 2 ]<lTt (1) (Here [a] denotes the greatest integer less than or equal to a.) Proof. Case h = 0: After deletion of the components which are neither critical nor deficient, we get from the definitions ) S 1 = I N(S)\T 1 + k = IN(S)~+k-~T~.Ifk-~T~~O,weget~S~~)N(S)Iandthelemma shows that there is no Hamiltonian cycle. This proves the theorem for h = 0. Case h > 0: We assume there is a Hamiltonian cycle in G. Let Ti (i = 0, 1, 2) be the subset of T consisting of those vertices which are linked by i edges of the considered Hamiltonian cycle to critical components. Then h < 1 T, I + 2 I T, I. For the r deficient components we get 2k = i 20 Ip I - I Kp I> < 2 I To I + I Tl I p=l A NOTE ON HAMILTONIAN SPLIT GRAPHS 247 and therefore Since the right-hand side is always even, this implies (1). Q.E.D. The existence of two edge disjoint matchings of I into K, which saturate the vertices of I is obviously necessary for the Hamiltonicity of split graphs (and it would be sufficient if it could assure the absence of subcycles). Lebensold [4] gave the following necessary and sufficient condition for the existence of two edge disjoint matchings C mW2, I W n W d)ll 2 2 I S I for all S C Z, (2) eN(S) where 6(S) denotes the set of edges incident with S. Lebensold’s condition is implied by (1). Indeed, for any S define T: = { y E I?(S) 1 1 6(S) n 6(( y))l > 2) and S* : = (x E S I 1 N(x)\ T t < l}. Then one obtains .- C .- 1 minC& I a(S) n a({ YHII = 2 I T I + I WS)\T I I/EN(S) and I S* I = h + k. Therefore c < 2 1 S I implies 2 1 S 1 > 2 1 T I + 2 I S 1 - 2(h + k) + h, a violation of (1). Q.E.D. The necessary condition (1) is not sufficient, as can be seen from the follow- ing example due to Payan and Xuong [6]: I = (1, 2, 3, 4, 51, K = (a, b, c, d e, .f>, and It would be interesting to know if condition (1) can be sharpened to a necessary and sufficient one. For threshold graphs (cf. [2]), which are a special case of the considered split graphs, a necessary and sufficient condition of Hamiltonicity was at 248 BURKARD AND HAMMER first given by Minty [5]. He showed that a threshold graph is Hamiltonian if and only if the vertices of its maximum independent set I can be indexed in such a way that the degree of vertex i is at least equal i + 1, for every i = l,.. ,j, where j= 111 - 1 (if 111 = IKI) and j= 111 otherwise Further it should be noted that (1) is also related to Chsivtal’s comb inequali- ties [l]. ACKNOWLEDGMENTS We thank V. Chvatal, L. Foldes, G. Minty, I. Rosenberg, and K. Thomassen for inter- esting discussions on this subject. Partial support through Grant A-8552 of the National Research Council of Canada is gratefully acknowledged. REFERENCES 1. V. CHVATAL, Edmonds polytopes and weakly hamiltonian graphs. Math. Programming 5 (1973), 29-40. 2. V. CHVATAL AND P. L. HAMMER, Aggregation of Inequalities in Integer Programming. Ann. Discrete Math. 1 (1977), 145-162. 3. S. F~LDES AND P. L. HAMMER, Split graphs, in “Proceedings of the Eighth SE Conference on Combinatorics, Graph Theory and Computing, 1977,” pp. 311-315. 4. K. LEBENSOLD, Disjoint matchings of graphs, J. Combinatorial Theory Ser. B 22 (1977), 207-210. 5. G. MINTY, Private communication, Oberwolfach, W. Germany, February 1976. 6. CH. PAYAN AND N. H. XUONG, Private communication, Grenoble, France, January 1979. .
Load more

Recommended publications
  • Finding Articulation Points and Bridges Articulation Points Articulation Point
    Finding Articulation Points and Bridges Articulation Points Articulation Point Articulation Point A vertex v is an articulation point (also called cut vertex) if removing v increases the number of connected components. A graph with two articulation points. 3 / 1 Articulation Points Given I An undirected, connected graph G = (V; E) I A DFS-tree T with the root r Lemma A DFS on an undirected graph does not produce any cross edges. Conclusion I If a descendant u of a vertex v is adjacent to a vertex w, then w is a descendant or ancestor of v. 4 / 1 Removing a Vertex v Assume, we remove a vertex v 6= r from the graph. Case 1: v is an articulation point. I There is a descendant u of v which is no longer reachable from r. I Thus, there is no edge from the tree containing u to the tree containing r. Case 2: v is not an articulation point. I All descendants of v are still reachable from r. I Thus, for each descendant u, there is an edge connecting the tree containing u with the tree containing r. 5 / 1 Removing a Vertex v Problem I v might have multiple subtrees, some adjacent to ancestors of v, and some not adjacent. Observation I A subtree is not split further (we only remove v). Theorem A vertex v is articulation point if and only if v has a child u such that neither u nor any of u's descendants are adjacent to an ancestor of v. Question I How do we determine this efficiently for all vertices? 6 / 1 Detecting Descendant-Ancestor Adjacency Lowpoint The lowpoint low(v) of a vertex v is the lowest depth of a vertex which is adjacent to v or a descendant of v.
    [Show full text]
  • The Strong Perfect Graph Theorem
    Annals of Mathematics, 164 (2006), 51–229 The strong perfect graph theorem ∗ ∗ By Maria Chudnovsky, Neil Robertson, Paul Seymour, * ∗∗∗ and Robin Thomas Abstract A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by Conforti, Cornu´ejols and Vuˇskovi´c — that every Berge graph either falls into one of a few basic classes, or admits one of a few kinds of separation (designed so that a minimum counterexample to Berge’s conjecture cannot have either of these properties). In this paper we prove both of these conjectures. 1. Introduction We begin with definitions of some of our terms which may be nonstandard. All graphs in this paper are finite and simple. The complement G of a graph G has the same vertex set as G, and distinct vertices u, v are adjacent in G just when they are not adjacent in G.Ahole of G is an induced subgraph of G which is a cycle of length at least 4. An antihole of G is an induced subgraph of G whose complement is a hole in G. A graph G is Berge if every hole and antihole of G has even length. A clique in G is a subset X of V (G) such that every two members of X are adjacent.
    [Show full text]
  • Algorithms for Deletion Problems on Split Graphs
    Algorithms for deletion problems on split graphs Dekel Tsur∗ Abstract In the Split to Block Vertex Deletion and Split to Threshold Vertex Deletion problems the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of at most k vertices such that G − S is a block graph and G − S is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are O∗(2.076k) and O∗(2.733k), respectively. Keywords graph algorithms, parameterized complexity. 1 Introduction A graph G is called a split graph if its vertex set can be partitioned into two disjoint sets C and I such that C is a clique and I is an independent set. A graph G is a block graph if every biconnected component of G is a clique. A graph G is a threshold graph if there is a t ∈ R and a function f : V (G) → R such that for every u, v ∈ V (G), (u, v) is an edge in G if and only if f(u)+ f(v) ≥ t. In the Split to Block Vertex Deletion (SBVD) problem the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of at most k vertices such that G − S is a block graph. Similarly, in the Split to Threshold Vertex Deletion (STVD) problem the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of at most k vertices such that G − S is a threshold graph.
    [Show full text]
  • Online Graph Coloring
    Online Graph Coloring Jinman Zhao - CSC2421 Online Graph coloring Input sequence: Output: Goal: Minimize k. k is the number of color used. Chromatic number: Smallest number of need for coloring. Denoted as . Lower bound Theorem: For every deterministic online algorithm there exists a logn-colorable graph for which the algorithm uses at least 2n/logn colors. The performance ratio of any deterministic online coloring algorithm is at least . Transparent online coloring game Adversary strategy : The collection of all subsets of {1,2,...,k} of size k/2. Avail(vt): Admissible colors consists of colors not used by its pre-neighbors. Hue(b)={Corlor(vi): Bin(vi) = b}: hue of a bin is the set of colors of vertices in the bin. H: hue collection is a set of all nonempty hues. #bin >= n/(k/2) #color<=k ratio>=2n/(k*k) Lower bound Theorem: For every randomized online algorithm there exists a k- colorable graph on which the algorithm uses at least n/k bins, where k=O(logn). The performance ratio of any randomized online coloring algorithm is at least . Adversary strategy for randomized algo Relaxing the constraint - blocked input Theorem: The performance ratio of any randomized algorithm, when the input is presented in blocks of size , is . Relaxing other constraints 1. Look-ahead and bufferring 2. Recoloring 3. Presorting vertices by degree 4. Disclosing the adversary’s previous coloring First Fit Use the smallest numbered color that does not violate the coloring requirement Induced subgraph A induced subgraph is a subset of the vertices of a graph G together with any edges whose endpoints are both in the subset.
    [Show full text]
  • Algorithmic Graph Theory Part III Perfect Graphs and Their Subclasses
    Algorithmic Graph Theory Part III Perfect Graphs and Their Subclasses Martin Milanicˇ [email protected] University of Primorska, Koper, Slovenia Dipartimento di Informatica Universita` degli Studi di Verona, March 2013 1/55 What we’ll do 1 THE BASICS. 2 PERFECT GRAPHS. 3 COGRAPHS. 4 CHORDAL GRAPHS. 5 SPLIT GRAPHS. 6 THRESHOLD GRAPHS. 7 INTERVAL GRAPHS. 2/55 THE BASICS. 2/55 Induced Subgraphs Recall: Definition Given two graphs G = (V , E) and G′ = (V ′, E ′), we say that G is an induced subgraph of G′ if V ⊆ V ′ and E = {uv ∈ E ′ : u, v ∈ V }. Equivalently: G can be obtained from G′ by deleting vertices. Notation: G < G′ 3/55 Hereditary Graph Properties Hereditary graph property (hereditary graph class) = a class of graphs closed under deletion of vertices = a class of graphs closed under taking induced subgraphs Formally: a set of graphs X such that G ∈ X and H < G ⇒ H ∈ X . 4/55 Hereditary Graph Properties Hereditary graph property (Hereditary graph class) = a class of graphs closed under deletion of vertices = a class of graphs closed under taking induced subgraphs Examples: forests complete graphs line graphs bipartite graphs planar graphs graphs of degree at most ∆ triangle-free graphs perfect graphs 5/55 Hereditary Graph Properties Why hereditary graph classes? Vertex deletions are very useful for developing algorithms for various graph optimization problems. Every hereditary graph property can be described in terms of forbidden induced subgraphs. 6/55 Hereditary Graph Properties H-free graph = a graph that does not contain H as an induced subgraph Free(H) = the class of H-free graphs Free(M) := H∈M Free(H) M-free graphT = a graph in Free(M) Proposition X hereditary ⇐⇒ X = Free(M) for some M M = {all (minimal) graphs not in X} The set M is the set of forbidden induced subgraphs for X.
    [Show full text]
  • On the Pathwidth of Chordal Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Applied Mathematics 45 (1993) 233-248 233 North-Holland On the pathwidth of chordal graphs Jens Gustedt* Technische Universitdt Berlin, Fachbereich Mathematik, Strape des I7 Jmi 136, 10623 Berlin, Germany Received 13 March 1990 Revised 8 February 1991 Abstract Gustedt, J., On the pathwidth of chordal graphs, Discrete Applied Mathematics 45 (1993) 233-248. In this paper we first show that the pathwidth problem for chordal graphs is NP-hard. Then we give polynomial algorithms for subclasses. One of those classes are the k-starlike graphs - a generalization of split graphs. The other class are the primitive starlike graphs a class of graphs where the intersection behavior of maximal cliques is strongly restricted. 1. Overview The pathwidth problem-PWP for short-has been studied in various fields of discrete mathematics. It asks for the size of a minimum path decomposition of a given graph, There are many other problems which have turned out to be equivalent (or nearly equivalent) formulations of our problem: - the interval graph extension problem, - the gate matrix layout problem, - the node search number problem, - the edge search number problem, see, e.g. [13,14] or [17]. The first three problems are easily seen to be reformula- tions. For the fourth there is an easy transformation to the third [14]. Section 2 in- troduces the problem as well as other problems and classes of graphs related to it. Section 3 gives basic facts on path decompositions.
    [Show full text]
  • On J-Colouring of Chithra Graphs Arxiv:1808.08661V1 [Math.GM] 27 Aug 2018
    On J-Colouring of Chithra Graphs Johan Kok1, Sudev Naduvath2∗ Centre for Studies in Discrete Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501, Kerala, India. [email protected],[email protected] Abstract The family of Chithra graphs is a wide ranging family of graphs which includes any graph of size at least one. Chithra graphs serve as a graph theoretical model for genetic engineering techniques or for modelling natural mutation within various biological networks found in living systems. In this paper, we discuss recently introduced J-colouring of the family of Chithra graphs. Keywords: Chithra graph, chromatic colouring of graphs, J-colouring of graphs, rainbow neighbourhood in a graph. AMS Classification Numbers: 05C15, 05C38, 05C75, 05C85. 1 Introduction For general notations and concepts in graphs and digraphs see [1, 2, 6]. Unless mentioned otherwise, all graphs G mentioned in this paper are simple and finite graphs. Note that the order and size of a graph G are denoted by ν(G) = n and "(G) = p. The minimum and maximum degrees of G are respectively denoted bby δ(G) and ∆(G). The degree of a vertex v 2 V (G) is denoted dG(v) or simply by d(v), when the context is clear. We recall that if C = fc1; c2; c3; : : : ; c`g and ` sufficiently large, is a set of distinct colours, a proper vertex colouring of a graph G denoted ' : V (G) 7! C is a vertex arXiv:1808.08661v1 [math.GM] 27 Aug 2018 colouring such that no two distinct adjacent vertices have the same colour.
    [Show full text]
  • Partitioning a Graph Into Disjoint Cliques and a Triangle-Free
    Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph Faisal N. Abu-Khzam, Carl Feghali, Haiko M¨uller January 6, 2015 Abstract A graph G =(V,E) is partitionable if there exists a partition {A, B} of V such that A induces a disjoint union of cliques and B induces a triangle- free graph. In this paper we investigate the computational complexity of deciding whether a graph is partitionable. The problem is known to be NP-complete on arbitrary graphs. Here it is proved that if a graph G is bull-free, planar, perfect, K4-free or does not contain certain holes then deciding whether G is partitionable is NP-complete. This answers an open question posed by Thomass´e, Trotignon and Vuˇskovi´c. In contrast a finite list of forbidden induced subgraphs is given for partitionable cographs. 1 Introduction A graph G = (V, E) is monopolar if there exists a partition {A, B} of V such that A induces a disjoint union of cliques and B forms an independent set. The class of monopolar graphs has been extensively studied in recent years. It is known that deciding whether a graph is monopolar is NP-complete [18], even when restricted to triangle-free graphs [6] and planar graphs [20]. In contrast the problem is tractable on several graph classes: a non-exhaustive list includes cographs [17], polar permutation graphs [15], chordal graphs [16], line graphs [7] and several others [8]. A graph is (k,l)-partitionable if it can be partitioned arXiv:1403.5961v6 [cs.CC] 4 Jan 2015 in up to k cliques and l independent sets with k + l ≥ 1.
    [Show full text]
  • Absolute Retracts of Split Graphs
    DISCRETE MATHEMATICS ELSEIVIER Discrete Mathematics 134 (1994) 75-84 Absolute retracts of split graphs Sandi Klaviar ’ University of’ Maribor, PF, KoroSka cesta 160, 62000 Maribor, Slosenia Received 20 February 1992; revised 20 July 1992 Abstract It is proved that a split graph is an absolute retract of split graphs if and only if a partition of its vertex set into a stable set and a complete set is unique or it is a complete split graph. Three equivalent conditions for a split graph to be an absolute retract of the class of all graphs are given. It is finally shown that a reflexive split graph G is an absolute retract of reflexive split graphs if and only if G has no retract isomorphic to some J,, n B 3. Here J, is the reflexive graph with vertex set {?c~,x*, . , x,,y,, y,, , y,} in which the vertices x1, x2, , x, are mutually adjacent and thevertexy,isadjacent to x~,x~,...,x~_~,x~+~,...,x,. 1. Introduction The main motivation for this paper is the investigation [l] by Bandelt et al. in which the internal structure of the absolute retracts of bipartite graphs is clarified. They proved several nice characterizations of bipartite absolute retracts and applied these graphs to the competitive location theory. However, the investigation of the absolute retracts of bipartite graphs started as early as in 1972 with the Ph.D. Thesis of Hell [S], who gave, among others, two characterizations of the absolute retracts of bipartite graphs. Split graphs are ‘half-way’ between bipartite graphs and their complements.
    [Show full text]
  • Solutions to Exercises 7
    Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 7 (1) The complete bipartite graph Km;n is defined by taking two disjoint sets, V1 of size m and V2 of size n, and putting an edge between u and v whenever u 2 V1 and v 2 V2. (a) How many edges does Km;n have? Solution. Every vertex of V1 is adjacent to every vertex of V2, hence the number of edges is mn. (b) What is the degree sequence of Km;n? Solution. Every vertex of V1 has degree n because it is adjacent to every vertex of V2. Similarly, every vertex of V2 has degree m because it is adjacent to every vertex of V2. So the degree sequence of Km;n consists of m n’s and n m’s listed in non-increasing order. If m ≥ n, then the degree sequence is (m; : : : ; m; n; : : : ; n): | {z } | {z } n m If m < n, then the degree sequence is (n; : : : ; n; m; : : : ; m): | {z } | {z } m n (c) Which complete bipartite graphs Km;n are connected? Solution. Take any m; n ≥ 1. For any vertex x 2 V1, y 2 V2, the pair xy is an edge, so x; y is a walk from x to y. For vertices x; y 2 V1, x 6= y, take any w 2 V2. The pairs xw; wy are edges, so x; w; y is a walk from x to y. For vertices x; y 2 V2, x 6= y, take any w 2 V1. The pairs xw; wy are edges, so x; w; y is a walk from x to y.
    [Show full text]
  • Lecture 3 Bipartite Graphs
    Topics in Discrete Mathematics Bipartite graphs arise naturally when we have two different types of vertices. For Part 2: Introduction to Graph Theory example, let X be the set of lecture classes set for 3pm on a Thursday, let Y be the set of lecture rooms, with an edge xy if class x will fit into room y. This is clearly bipartite. Lecture 3 A useful graph to work with is the complete bipartite graph. Example 3.2. The complete bipartite graph Ka;b with a vertices on the left and b Bipartite Graphs vertices on the right is defined by X = [a] Y = [b] E = fxy : x 2 [a]; y 2 [b]g: • Definition of bipartite graphs • Complete bipartite graphs • Matchings and Hall's marriage theorem 3.1 Basics K2,2 K3,4 Consider the following graph: the vertices will be the people in the Bristol maths (Technically we've given some vertices on the left and right the same label, but department, and there will be an edge between two people if one has lectured the using the `isomorphism trick' again, we won't let this bother us.) other this year. Note that Ka;b is isomorphic to Kb;a. Other examples of bipartite graphs include the even cycles, Cn for odd n, and the Bober paths Pn. Topics in Discrete Matt Maths 3.2 Matchings Karen A common toy example of a bipartite graph is this: Let X be a set of girls, let Y be Ganesh a set of boys, and let xy be an edge if girl x knows boy y.
    [Show full text]
  • Differential Coloring of Graphs 163
    CORE Metadata, citation and similar papers at core.ac.uk SUT Journal of Mathematics Vol. 47, No. 2 (2011), 161{174 Di®erential Coloring of Graphs P. Roushini Leely Pushpam, I. Sahul Hamid and D. Yokesh (Received March 11, 2011; Revised September 18, 2011) Abstract. Let G = (V; E) be a connected graph. For a set S ⊆ V , the di®erential of S, denoted by @(S), is de¯ned to be @(S) = jB(S)j ¡ jSj, where B(S) = N(S) \ (V ¡ S). A set S ⊆ V is said to be a positive di®erential set if @(S) ¸ 0. A partition fV1;V2;:::;Vkg of V is said to be a positive di®erential chromatic partition of G if each Vi is both independent and positive di®erential. The minimum order of a positive di®erential chromatic partition of G is called the di®erential chromatic number of G and is denoted by Â@ (G). In this paper we initiate a study of this parameter. AMS 2010 Mathematics Subject Classi¯cation. 05C. Key words and phrases. Di®erential coloring, di®erential chromatic number. x1. Introduction By a graph G = (V; E), we mean a ¯nite, undirected graph with neither loops nor multiple edges. For graph theoretic terminology we refer to Chartrand and Lesniak [1]. All graphs in this paper are assumed to be connected with at least two vertices. For a vertex v 2 V , the open neighborhood of v is the set N(v) = fu 2 V juv 2 Eg and the closed neighborhood is the set N[v] = N(v) [ fvg.
    [Show full text]