Advertisement

Nordhaus–Gaddum-Type Theorem for Total-Proper Connection Number of Graphs

  • Wenjing Li
  • Xueliang LiEmail author
  • Jingshu Zhang
Article

Abstract

A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A path P in a total-colored graph G is called a total-proper path if (1) any two adjacent edges of P are assigned distinct colors; (2) any two adjacent internal vertices of P are assigned distinct colors; and (3) any internal vertex of P is assigned a distinct color from its incident edges of P. The total-colored graph G is total-proper connected if any two distinct vertices of G are connected by a total-proper path. The total-proper connection number of a connected graph G, denoted by tpc(G), is the minimum number of colors that are required to make G total-proper connected. In this paper, we first characterize the graphs G on n vertices with \(tpc(G)=n-1\). Based on this, we obtain a Nordhaus–Gaddum-type result for total-proper connection number. We prove that if G and \(\overline{G}\) are connected complementary graphs on n vertices, then \(6\le tpc(G)+tpc(\overline{G})\le n+2\). Examples are given to show that the lower bound is sharp for \(n\ge 4\). The upper bound is reached for \(n\ge 4\) if and only if G or \(\overline{G}\) is the tree with maximum degree \(n-2\).

Keywords

Total-proper path Total-proper connection number Complementary graph Nordhaus–Gaddum-type 

Mathematics Subject Classification

05C15 05C35 05C38 05C40 

Notes

Acknowledgements

The authors would like to thank the reviewers for their helpful comments and suggestions, which helped to improve the presentation of the paper.

References

  1. 1.
    Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press, London and Basingstoker (1976)CrossRefzbMATHGoogle Scholar
  2. 2.
    Borozan, V., Fujita, S., Gerek, A., Magnant, C., Manoussakis, Y., Montero, L., Tuza, Zs: Proper connection of graphs. Discrete Math. 312, 2550–2560 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Math. Bohem. 133(1), 85–98 (2008)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Harary, F., Haynes, T.W.: Nordhaus–Gaddum inequalities for domination in graphs. Discrete Math. 155, 99–105 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Harary, F., Robinson, R.W.: The diameter of a graph and its complement. Am. Math. Monthly 92, 211–212 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Huang, F., Li, X., Wang, S.: Proper connection numbers of complementary graphs, Bull. Malays. Math. Sci. Soc., DOI: 10.1007/s40840-016-0381-8 (in press)
  7. 7.
    Jiang, H., Li, X., Zhang, Y.: Total proper connection of graphs, arXiv preprint arXiv:1512.00726 [math.CO]
  8. 8.
    Li, X., Magnant, C.: Properly colored notions of connectivity—a dynamic survey. Theory Appl. Graphs 0(1)(2015), Art. 2Google Scholar
  9. 9.
    Li, X., Sun, Y.: Rainbow Connections of Graphs. Springer, New York (2012). SpringerBriefs in MathCrossRefzbMATHGoogle Scholar
  10. 10.
    Nordhaus, E.A., Gaddum, J.W.: On complementary graphs. Am. Math. Monthly 63, 175–177 (1956)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia 2017

Authors and Affiliations

  1. 1.Center for Combinatorics and LPMCNankai UniversityTianjinChina
  2. 2.School of Mathematics and StatisticsQinghai Normal UniversityXiningChina

Personalised recommendations