Skip to main content

A Characterization for \(V_4\)-Vertex Magicness of Trees with Diameter 5

  • Conference paper
  • First Online:
Computational Sciences - Modelling, Computing and Soft Computing (CSMCS 2020)

Abstract

Let G be an undirected simple graph with vertex set V(G) and the edge set E(G) and \(\mathcal {A}\) be an additive Abelian group with the identity element 0. A function \(l:V(G)\rightarrow \mathcal {A}\setminus \{0\}\) is said to be a \(\mathcal {A}\)-vertex magic labeling of G if there exists an element \(\mu \) of \(\mathcal {A}\) such that \(w(v)=\sum _{u\in N(v)}l(u)=\mu \) for any vertex v of G. A graph G having \(\mathcal {A}\)-vertex magic labeling is called a \(\mathcal {A}\)-vertex magic graph. If G is \(\mathcal {A}\)-vertex magic graph for every non-trivial additive Abelian group \(\mathcal {A}\), then G is called a group vertex magic graph. In this article, a characterization for the \(\mathcal {A}\)-vertex magicness of any tree T with diameter 5, is given, when \(\mathcal {A}\cong \mathbb {Z}_2 \oplus \mathbb {Z}_2\).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Elsevier Science Publishing Co., Inc., New York (1976)

    Book  Google Scholar 

  2. Herstein, I. N.: Topics in algebra, John Wiley & Sons, New York (2006)

    Google Scholar 

  3. Colbourn, C., Dinitz, J. (eds.): The CRC Handbook of Combinatorial Designs, Chapman and Hall/CRC, Boca Raton, FL (2007)

    Google Scholar 

  4. Lee, S.M., Sun, H., Wen, I.: On group-magic graphs. J. Comb. Math. Comb. Comput. 38, 197–207 (2001)

    MathSciNet  MATH  Google Scholar 

  5. Kamatchi, N., Paramasivam, K., Prajeesh, A.V., Muhammed Sabeel, K., Arumugam, S.: On group vertex magic graphs. AKCE Int. J. Graphs Comb. 17(1), 461–465 (2020)

    Article  MathSciNet  Google Scholar 

  6. Lee, S.M., Saba, F., Salehi, E., Sun, H.: On the \(V_4\)-magic graphs. Congr. Numer. 156, 59–67 (2002)

    MathSciNet  MATH  Google Scholar 

  7. Low, R.M., Lee, S.M.: On the products of group-magic graphs. Australas. J. Comb. 34, 41–48 (2006)

    MathSciNet  MATH  Google Scholar 

  8. Shiu, W.C., Lam, P.C.B., Sun, P.K.: Construction of group-magic graphs and some a-magic graphs with a of even order. In: Proceedings of the Thirty-Fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium, vol. 167, pp. 97–107 (2004)

    Google Scholar 

  9. Low, R.M., Lee, S.M.: On group-magic Eulerian graphs. J. Comb. Math. Comb. Comput. 50, 141–148 (2004)

    MathSciNet  MATH  Google Scholar 

  10. Shiu, W.C., Low, R.M.: Group-magic labelings of graphs with deleted edges. Australas. J. Comb. 57, 3–19 (2013)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Krishnan Paramasivam .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kollaran, M.S., Prajeesh, A.V., Paramasivam, K. (2021). A Characterization for \(V_4\)-Vertex Magicness of Trees with Diameter 5. In: Awasthi, A., John, S.J., Panda, S. (eds) Computational Sciences - Modelling, Computing and Soft Computing. CSMCS 2020. Communications in Computer and Information Science, vol 1345. Springer, Singapore. https://doi.org/10.1007/978-981-16-4772-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-4772-7_19

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-4771-0

  • Online ISBN: 978-981-16-4772-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics