Skip to main content
SpringerLink
Log in

Strong Kernel Number in Certain Oriented Cycle Extension of Graphs

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

Abstract

A kernel in a directed graph D(V, E) is a set S of vertices of D such that no two vertices in S are adjacent and for every vertex u in V\S there is a vertex v in S, such that (u, v) is an arc of D. The problem of existence of a kernel is itself an NP-complete for a general digraph. But in this paper we solve the strong kernel problem for certain oriented Cycle Extension of graphs namely Circular Ladder and Petersen Graphs.

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. Alzoubi, K.M., Wan, P.J., Frieder, O.: New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks. In: Proceedings 35th Hawaii International Conference System Sciences, pp. 01–07 (2002)

  2. Armugam S., Velammal S.: Maximum size of a connected graph with given domination parameters. ARS Combinatoria. 52, 221–227 (1992)

    Google Scholar 

  3. Berge C., Duchet P.: Recent problems and results about kernels in directed graphs. Discrete. Math. 86, 27–31 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chvàtal, V.: On the computational complexity of finding a kernel, Report No. CRM-300, Centre de Recherches Mathematiques, Universite de Montreal, (1973)

  5. Berge C.: Graphs, volume 6. North Holland Publishing Co., Amsterdam (1985)

    Google Scholar 

  6. Fraenkel A.S.: Planar kernel and Grundy with d ≤ 3, d + ≤ 2, d − ≤ 2 are NP-complete. Discrete. Appl. Math. 3, 257–262 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. Rajasingh, I., Rajan, B., Punitha, J., Manuel, P.: Total—kernel in oriented circular ladder and mobius ladder. ARS Combinatoria., (2011)

  8. Le Bars J.-M.: Counterexample of the 0–1 Law for fragments of existential second-order logic: an overview. Bull. Symb. Logic. 6(1), 67–82 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Wu J.: Extended dominating-set-based routing in Ad Hoc wireless networks with Unidirectional Links. IEEE. Trans. Parallel. Distrib. Syst. 13, 866–881 (2002)

    Article  Google Scholar 

  10. Hsu, L.-H., Lin, C.-K.: Graph theory and interconnection networks. Auerbach Publications, CRC Press, London (2008)

  11. Manuel P., Rajasingh I., Rajan B., Punitha J.: Kernel in Petersen Graphs. J. Comb. Inform. Syst. Sci. 33, 17–26 (2008)

    MATH  Google Scholar 

  12. Manuel, P., Rajasingh, I., Rajan, B., Punitha, J.: Kernel in oriented circulant graphs, combinatorial algorithms. LNCS, Springer, Berlin 5874 (2009)

  13. Van Leeuwen, J.: Having a Grundy-numbering is NP-complete, Report No. 207, Computer Science Department, Pennsylvania State University, University Park, (1976)

  14. Von Neumann J., Morgenstern O.: Theory of games and economic behaviour. Princeton University Press, Princeton (1944)

    Google Scholar 

  15. Wang J.-J., Hung C.-N., Tan J.J.M., Hsu L.-H., Sung T.-Y.: Construction schemes for fault-tolerant Hamiltonian graphs. Networks. 35, 233 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Xu, J.: Topological structure and analysis of interconnection networks. Kluwer Academic Publishers, (2001)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, L. N. Government College, Ponneri, India

    M. Joice Punitha

Authors
  1. M. Joice Punitha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Joice Punitha.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Punitha, M.J. Strong Kernel Number in Certain Oriented Cycle Extension of Graphs. Math.Comput.Sci. 9, 193–199 (2015). https://doi.org/10.1007/s11786-015-0225-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-015-0225-1

Keywords

Mathematics Subject Classification

Search

Navigation