Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Applications in Management

AAIM 2022: Algorithmic Aspects in Information and Management pp 293–302Cite as

Polynomial Time Algorithm for k-vertex-edge Dominating Problem in Interval Graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13513))

Abstract

Let G be an interval graph with n vertices and m edges. For any positive integer k and any subset S of E(G), we design an \(O(n|S|+m)\) time algorithm to find a minimum k-vertex-edge dominating set of G with respect to S. This shows that the vertex-edge domination problem and the double vertex-edge domination problem can be solved in linear time. Furthermore, the k-vertex-edge domination problem can be solved in O(nm) time algorithm in interval graphs.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Żyliński, P.: Vertex-edge domination in graphs. Aequationes Math. 93(4), 735–742 (2018). https://doi.org/10.1007/s00010-018-0609-9

    Article  MathSciNet  MATH  Google Scholar 

  2. Boutrig, R., Chellali, M.: Total vertex-edge domination. Int. J. Comput. Math. 95(9), 1820–1828 (2018)

    Article  MathSciNet  Google Scholar 

  3. Fishburn, P.C.: Interval Orders and Interval Graphs: A Study of Partially Ordered Sets, John Wiley & Sons Inc., (1985)

    Google Scholar 

  4. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd ed., Annals of Discrete Mathematics, 57, Elsevier, Amsterdam, The Netherlands (2004)

    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. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc, New York (1998)

    MATH  Google Scholar 

  7. Krishnakumari, B., Chellali, M., Venkatakrishnan, Y.B.: Double vertex-edge domination. Discrete Math Algorithms Appl. 09(04), 1750045 (2017)

    Article  MathSciNet  Google Scholar 

  8. Krishnakumari, B., Venkatakrishnan, Y.B., Krzywkowski, M.: Bounds on the vertex-edge domination number of a tree. C R Math 352(5), 363–366 (2014)

    Article  MathSciNet  Google Scholar 

  9. Lewis, J.R.: Vertex-edge and edge-vertex parameters in graphs, Ph.D. thesis, Clemson, SC, USA, (2007)

    Google Scholar 

  10. Lewis, J.R., Hedetniemi, S.T., Haynes, T.W., Fricke, G.H.: Vertex-edge domination. Util Math 81, 193–213 (2010)

    MathSciNet  MATH  Google Scholar 

  11. Li, P., Wu, Y.: Spanning connectedness and Hamiltonian thickness of graphs and interval graphs. Discrete Math. Theor. Comput. Sci. 16(2), 125–210 (2015)

    Article  MathSciNet  Google Scholar 

  12. Li, P., Wu, Y.: A linear time algorithm for the 1-fixed-endpoint path cover problem on interval graphs. SIAM J. Discret. Math. 31(1), 210–239 (2017)

    Article  MathSciNet  Google Scholar 

  13. Möhring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Orders, pp. 41–101. D. Reidel, Boston (1985)

    Chapter  Google Scholar 

  14. Paul, S., Ranjan, K.: Results on vertex-edge and independent vertex-edge domination. J. Comb. Optim. 4, 1–28 (2021). https://doi.org/10.1007/s10878-021-00832-z

    Article  MATH  Google Scholar 

  15. Peters, J.K.W.: Theoretical and algorithmic results on domination and connectivity (NordhausCGaddum, Gallai type results, maxCmin relationships, linear time, seriesCparallel), Ph.D. thesis, Clemson, SC, USA (1986)

    Google Scholar 

  16. Ramalingam, G., Rangan, C.P.: A uniform approach to domination problems on interval graphs. Inf. Process. Lett. 27, 271–274 (1988)

    Article  Google Scholar 

  17. Raychaudhuri, A.: On powers of interval and unit interval graphs. Congr. Numer. 59, 235–242 (1987)

    MathSciNet  MATH  Google Scholar 

  18. Shang, J., Li, P., Shi, Y.: The longest cycle problem is polynomial on interval graphs. Theoret. Comput. Sci. 859, 37–47 (2021)

    Article  MathSciNet  Google Scholar 

  19. Trotter, W.T.: New perspectives on interval orders and interval graphs. In: Bailey, R.A. (ed.) London Mathematical Society Lecture Note Series 241, pp. 237–286. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  20. Żyliński, P.: Vertex-edge domination in graphs. Aequationes Math. 93(4), 735–742 (2018). https://doi.org/10.1007/s00010-018-0609-9

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

We thank the referees and editors for their constructive input. This work was supported by the National Natural Science Foundation of China (11701059), the Natural Science Foundation of Chongqing (cstc2019jcyj-msxmX0156, cstc2020jcyj-msxmX0272, cstc2021jcyj-msxmX0436), the Youth project of science and technology research program of Chongqing Education Commission of China(KJQN202 001130, KJQN202001107, KJQN202101130).

Author information

Authors and Affiliations

  1. Chongqing University of Technology, 69 Hongguang Road, Chongqing, China

    Peng Li & Aifa Wang

Authors
  1. Peng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aifa Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aifa Wang .

Editor information

Editors and Affiliations

  1. Guangdong University of Technology, Guangzhou, China

    Qiufen Ni

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

    Weili Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, P., Wang, A. (2022). Polynomial Time Algorithm for k-vertex-edge Dominating Problem in Interval Graphs. In: Ni, Q., Wu, W. (eds) Algorithmic Aspects in Information and Management. AAIM 2022. Lecture Notes in Computer Science, vol 13513. Springer, Cham. https://doi.org/10.1007/978-3-031-16081-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-16081-3_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-16080-6

  • Online ISBN: 978-3-031-16081-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation