Skip to main content
SpringerLink
Log in

Clique Vertex Magic Cover of a Graph

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

Abstract

Let G admit an H-edge covering and \({f : V \cup E \to \{1,2,\ldots,n+e\}}\) be a bijective mapping for G then f is called H-edge magic total labeling of G if there is a positive integer constant m(f) such that each subgraph H i , i = 1, . . . , r of G is isomorphic to H and \({f(H_i)=f(H)=\Sigma_{v \in V(H_i)}f(v)+\Sigma_{e \in E(H_i)} f(e)=m(f)}\). In this paper we define a subgraph-vertex magic cover of a graph and give some construction of some families of graphs that admit this property. We show the construction of some C n - vertex magic covered and clique magic covered 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. Bača M., Holländer I., Lih K.W.: Two classes of super-magic quartic graphs. J. Combin. Math. Combin. Comput. 23, 113–120 (1997)

    MathSciNet  MATH  Google Scholar 

  2. Blackley, G.R.: Safeguarding cryptography keys. In: Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317 (1979)

  3. Enomoto H., Llado A.S., Nakamigawa T., Ringel G.: Super edge-magic graphs. SUT J. Math. 34, 105–109 (1998)

    MathSciNet  MATH  Google Scholar 

  4. Gallian, J.: A dynamic survey of graph labeling. Electron. J. Combin. 6, DS 6 (2010)

  5. Gutiérrez A., Lladó A.: Magic coverings. JCMCC 55, 43–56 (2006)

    Google Scholar 

  6. Harary, F.: Graph Theory. Reading. Addison-Wesley, MA (1994)

  7. Kotzig A., Rosa A.: Magic valuations of finite graphs. Can. Math. Bull. 13, 451–461 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lih K.-W.: On magic and consecutive labelings of plane graphs. Util. Math. 24, 165–197 (1983)

    MathSciNet  MATH  Google Scholar 

  9. Sedláček, J.: Problem 27. In: Theory of Graphs and Its Applications, Proc. Symposium Smolenice, pp. 163–167 (1963)

  10. Shamir A.: How to share a secret. Commun. ACM 22, 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  11. Simanjuntak, R., Bertault, F., Miller, M.: Two new (a, d)-antimagic graph labelings. In: Proceedings of Eleventh Australia Workshop Combin. pp. 179–189. Algor. Hunter Valley, Australia (2000)

  12. Stewart B.M.: Magic graphs. Can. J. Math. 18, 1031–1059 (1966)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Mathematics and Sciences, University of Indonesia, Depok, 16424, Indonesia

    K. A. Sugeng

  2. School of Electrical Engineering and Computer Science, University of Newcastle, Newcastle, NSW, 2308, Australia

    J. Ryan

Authors
  1. K. A. Sugeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Ryan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. A. Sugeng.

Additional information

This research is conducted when the first author visited University of Ballarat by Endeavour Research Scholarship Funding in 2007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sugeng, K.A., Ryan, J. Clique Vertex Magic Cover of a Graph. Math.Comput.Sci. 5, 113–118 (2011). https://doi.org/10.1007/s11786-011-0077-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-011-0077-2

Keywords

Mathematics Subject Classification (2010)

Search

Navigation