Skip to main content
SpringerLink
Log in

Loose Cover of Graphs

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

This paper introduces a new definition of embedding a local structure to a given network, called loose cover of graphs. We derive several basic properties on the notion of loose cover, which includes transitivity, maximality, and the computational complexity of finding a loose cover by paths and cycles. In particular, we show that the decision problem is in P if the given local structure is a path with three or less vertices, while it is NP-complete for paths consisting of six or more vertices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bertossi A.A.: On the domatic number of interval graphs. Inf. Process. Lett. 28(6), 275–280 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bonuccelli M.A.: Dominating sets and domatic number of circular arc graphs. Discret. Appl. Math. 12, 203–213 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fujita S., Yamashita M., Kameda T.: A study of r-configurations—a resource assignment problem on graphs. SIAM J. Discret. Math. 13(2), 227–254 (2000)

    Article  MathSciNet  Google Scholar 

  4. Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, Inc., New York (1998)

    MATH  Google Scholar 

  5. Haynes T.W., Hedetniemi S.T., Slater P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, Inc., New York (1998)

    MATH  Google Scholar 

  6. Kratochvil J., Proskurowski A., Telle J.: Covering regular graphs. J. Comb. Theory B 71(1), 1–16 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kratochvil J., Proskurowski A., Telle J.: Complexity of graph covering problems. Nord. J. Comput. 5(3), 173–195 (1998)

    MathSciNet  MATH  Google Scholar 

  8. Lu T.L., Ho P.H., Chang G.J.: The domatic number problem in interval graphs. SIAM J. Discret. Math. 3, 531–536 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Manacher G.K., Mankus T.A.: Finding a domatic partition of an interval graph in time O(n). SIAM J. Discret. Math. 9(2), 167–172 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. Peng S.L., Chang M.S.: A simple linear time algorithm for the domatic partition problem on strongly chordal graphs. Inf. Process. Lett. 43, 297–300 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Srinivasa Rao A., Rangan C.P.: Linear algorithm for domatic number problem on interval graphs. Inf. Process. Lett. 33(1), 29–33 (1989)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527, Japan

    Satoshi Fujita

Authors
  1. Satoshi Fujita
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Satoshi Fujita.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fujita, S. Loose Cover of Graphs. Math.Comput.Sci. 3, 31–38 (2010). https://doi.org/10.1007/s11786-009-0010-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-009-0010-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation