Skip to main content
SpringerLink
Log in

Independent Perfect Domination Sets in Semi-Cayley Graphs

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12290))

Included in the following conference series:

  • 869 Accesses

Abstract

An independent perfect domination set in a graph \(\varGamma \) is an independent set S of \(V(\varGamma )\) such that every vertex of \(V(\varGamma )\setminus S\) is adjacent to exactly one vertex in S. In this paper, we first give a necessary and sufficient condition for the existence of independent perfect domination sets in Semi-Cayley graph SC(G; R, R, T) over finite group G. Further, we obtain a necessary and sufficient condition for Cayley graphs on two class non-abelian groups to have independent perfect domination sets.

Supported by the National Numerical Windtunnel Project (No. NNW2019ZT5-B16), the National Natural Science Foundation of China (Grant No. 11571155).

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

Access this chapter

Log in via an institution
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. Chelvam, T.T., Rani, I.: Dominating sets in Cayley graphs on \(Z_n\). Tamkang. Math. 37(4), 341–345 (2007)

    Article  MathSciNet  Google Scholar 

  2. Chelvam, T.T., Mutharasu, S.: Subgroups as efficient dominating sets in Cayley graphs. Discrete Appl. Math. 161(9), 1187–1190 (2013)

    Article  MathSciNet  Google Scholar 

  3. Deng, Y.: Efficient dominating sets in circulant graphs with domination number prime. Inf. Process. Lett. 114(12), 700–702 (2014)

    Article  MathSciNet  Google Scholar 

  4. Deng, Y., Sun, Y., Liu, Q., Wang, H.: Efficient domination sets in circulant graphs. Discrete Math. 340(7), 1503–1507 (2017)

    Article  MathSciNet  Google Scholar 

  5. Gao, X., Luo, Y.: The spectrum of semi-Cayley graphs over abelian groups. Linear Algebra Appl. 432(11), 2974–2983 (2010)

    Article  MathSciNet  Google Scholar 

  6. Godsil, C., Royle, G.: Algebraic Graph Theory, 1st edn. Springer, New York (2001). https://doi.org/10.1007/978-1-4613-0163-9

    Book  MATH  Google Scholar 

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

    MATH  Google Scholar 

  8. Kumar, K.R., MacGillivray, G.: Efficient domination in circulant graphs. Discrete Math. 313(6), 767–771 (2013)

    Article  MathSciNet  Google Scholar 

  9. Kwak, J.H., Chun, J.-H., Lee, J.: Enumeration of regular graph coverings having finite abelian covering transformation groups. SIAM J. Discrete Math. 11(2), 273–285 (1998)

    Article  MathSciNet  Google Scholar 

  10. Lee, J.: Independent perfect domination sets in Cayley graphs. J. Graph Theory. 37(4), 213–219 (2001). https://doi.org/10.1023/A:1022476321014

    Article  MathSciNet  MATH  Google Scholar 

  11. Obradović, N., Peters, J., Ružić, G.: Efficient domination in circulant graphs with chord lengths. Inf. Process. Lett. 102(6), 253–258 (2007)

    Article  MathSciNet  Google Scholar 

  12. Resmi, M.J.D., Jungnickel, D.: Strongly regular Semi-Cayley graphs. J. Algebra Combi. 1, 171–195 (1992). https://doi.org/10.1023/A:1022476321014

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Lanzhou University, Lanzhou, China

    Xiaomeng Wang, Shou-Jun Xu & Xianyue Li

Authors
  1. Xiaomeng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shou-Jun Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xianyue Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shou-Jun Xu .

Editor information

Editors and Affiliations

  1. Zhejiang Normal University, Jinhua, China

    Zhao Zhang

  2. Texas Southern University, Houston, TX, USA

    Wei Li

  3. University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, X., Xu, SJ., Li, X. (2020). Independent Perfect Domination Sets in Semi-Cayley Graphs. In: Zhang, Z., Li, W., Du, DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science(), vol 12290. Springer, Cham. https://doi.org/10.1007/978-3-030-57602-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57602-8_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-57601-1

  • Online ISBN: 978-3-030-57602-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation