IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-76796-1_14.html
   My bibliography  Save this book chapter

On the Structure of Graphs Vertex Critical with Respect to Connected Domination

In: Research Trends in Combinatorial Optimization

Author

Listed:
  • Michael D. Plummer

    (Vanderbilt University, Department of Mathematics)

Abstract

Summary A dominating set of vertices S of a graph G is connected if the subgraph G[S] is connected. Let γ c (G) denote the size of any smallest connected dominating set in G. Graph G is k-γ-connected-vertex-critical (abbreviated “kcvc”) if $\gamma_{c}(G)=\nobreak k$ , but if any vertex v is deleted from G, then γ c (G−v)≤k−1. This concept of vertex criticality stands in contrast to the concept of criticality with respect to edge addition in which a graph G is defined to be k-connected-critical if the connected domination number of G is k, but if any edge is added to G, the connected domination number falls to k−1. It is well-known that the only 1cvc graph is K 1 and the 2cvc graphs are obtained from the even complete graphs K 2n , with n≥2, by deleting a perfect matching. In this paper we survey some recent results for the case when γ c =3. In Sect. 14.2 we present some recently derived basic properties of 3cvc graphs, especially with respect to connectivity, and then present three new infinite families of 3cvc graphs. In Sect. 14.3, we present some new matching results for 3cvc graphs.

Suggested Citation

  • Michael D. Plummer, 2009. "On the Structure of Graphs Vertex Critical with Respect to Connected Domination," Springer Books, in: William Cook & László Lovász & Jens Vygen (ed.), Research Trends in Combinatorial Optimization, chapter 14, pages 303-315, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-76796-1_14
    DOI: 10.1007/978-3-540-76796-1_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-76796-1_14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.