Advertisement

Sharp Nordhaus–Gaddum-Type Lower Bounds for Proper Connection Numbers of Graphs

  • Yuefang SunEmail author
Chapter
  • 832 Downloads
Part of the Springer Optimization and Its Applications book series (SOIA, volume 139)

Abstract

An edge-colored connected graph G is called properly connected if between every pair of distinct vertices, there exists a path that is properly colored. The proper connection number of a connected graph G, denoted by pc(G), is the minimum number of colors needed to color the edges of G to make it properly connected. In this work, we obtain sharp lower bounds for \(pc(G)+ pc(\overline {G})\), and \(pc(G)pc(\overline {G})\), where G is a connected graph of order at least 8. Among our results, we also get sharp lower bounds for \(pvc(G)+pvc(\overline {G})\), \(pvc(G)pvc(\overline {G})\), \(ptc(G)+ptc(\overline {G})\) and \(ptc(G)ptc(\overline {G})\), where pvc(G) and ptc(G) are proper vertex-connection number and proper total-connection number of G, respectively.

Notes

Acknowledgements

This work was supported by National Natural Science Foundation of China (No. 11401389) and China Scholarship Council (No. 201608330111). The author is very grateful to the referee for helpful comments and suggestions.

References

  1. 1.
    J. Bang-Jensen, G. Gutin, Alternating cycles and paths in edge-coloured multigraphs: a survey. Discret. Math. 165/166, 39–60 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    J. Bang-Jensen, G. Gutin, Digraphs Theory, Algorithms and Applications, 2nd edn. Springer Monographs in Mathematics (Springer, London, 2009)Google Scholar
  3. 3.
    J.A. Bondy, U.S.R. Murty, Graph Theory. Graduate Texts in Mathematics, vol. 244 (Springer, Berlin, 2008)CrossRefzbMATHGoogle Scholar
  4. 4.
    V. Borozan, S. Fujita, A. Gerek, C. Magnant, Y. Manoussakis, L. Montero, Z. Tuza, Proper connection of graphs. Discret. Math. 312(17), 2550–2560 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    G. Chartrand, G.L. Johns, K.A. McKeon, P. Zhang, Rainbow connection in graphs. Math. Bohem. 133(1), 85–98 (2008)MathSciNetzbMATHGoogle Scholar
  6. 6.
    E. Chizmar, C. Magnant, P. Salehi Nowbandegani, Note on vertex and total proper connection numbers. AKCE Int. J. Graphs Comb. 13(2), 103–106 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    W.S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza, Paths through fixed vertices in edge-colored graphs. Math. Inform. Sci. Hum. 127, 49–58 (1994)Google Scholar
  8. 8.
    D. Dorninger, On permutations of chromosomes, in Contributions to General Algebra, vol. 5 (Verlag Hölder-Pichler-Tempsky/Teubner, Wien/Stuttgart, 1987), pp. 95–103Google Scholar
  9. 9.
    D. Dorninger, Hamiltonian circuits determining the order of chromosomes. Discret. Appl. Math. 50(2), 159–168 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    D. Dorninger, W. Timischl, Geometrical constraints on Bennet’s predictions of chromosome order. Heredity 58, 321–325 (1987)CrossRefGoogle Scholar
  11. 11.
    F. Harary, T.W. Haynes, Nordhaus-Gaddum inequalities for domination in graphs. Discret. Math. 155, 99–100 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    F. Harary, R.W. Robinson, The diameter of a graph and its complement. Am. Math. Mon. 92, 211–212 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    F. Huang, X. Li, S. Wang, Proper connection number of complementary graphs. Arxiv:1504.02414Google Scholar
  14. 14.
    H. Jiang, X. Li, Y. Zhang, Y. Zhao, On (strong) proper vertex-connection of graphs. Arxiv:1505.04986Google Scholar
  15. 15.
    X. Li, C. Magnant, Properly colored notions of connectivity – a dynamic survey. Theory Appl. Graphs 0(1), Art. 2, 1–16 (2015)Google Scholar
  16. 16.
    X. Li, Y. Sun, Rainbow Connections of Graphs. Springer Briefs in Mathematics (Springer, New York, 2012)CrossRefzbMATHGoogle Scholar
  17. 17.
    X. Li, Y. Shi, Y. Sun, Rainbow connections of graphs: a survey. Graphs Combin. 29, 1–38 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    E.A. Nordhaus, J.W. Gaddum, On complementary graphs. Am. Math. Mon. 63, 175–177 (1956)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Y. Sun, On rainbow total-coloring of a graph. Discret. Appl. Math. 194, 171–177 (2015)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsShaoxing UniversityZhejiangPeople’s Republic of China

Personalised recommendations