Abstract
In this paper we get some relations between α(G), α′(G), β(G), β′(G) and α T (G), β T (G). And all bounds in these relations are best possible, where α(G), α′(G), β(G), β′(G), α T (G) and β T (G) are the covering number, edge-covering number, independent number, edge-independent number (or matching number), total covering number and total independent number, respectively.
Similar content being viewed by others
References
Alavi, Y., Bchzad, M., Lesniak-Foster, L.M., Nordhaus, E.A. Total matchings and total coverings. Graph Theory, 1: 135–140 (1977)
Alavi, Y., Liu, J., Wang, J., Zhang, Z. On total covers of graphs, Discrete Mathematics 100: 229–233 (1992)
Chartrand, G., Lesniak, L. Graphs and digraphs (Wadsworth, Belmont, CA, 1986).
Harary, F. Graph theory. Addison-Wesley, Reading (1969)
Zhang, Z. On relations between the covering number of a graph and its complementary graph. Chinese Science Bulletin, 34(14): 1226–1232 (1989)
Zhang, Z., Zhang, J., Li, J. On the relations between the parameters of graphs. Taiwanese Journal of Mathematics, 10(6): 1549–1556 (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No. 10771091) and Com2MaC-KOSEF (No. (E)ndzr09-15).
Rights and permissions
About this article
Cite this article
Li, Jw., Wang, Zw., Lee, J. et al. On the relations of graph parameters and its total parameters. Acta Math. Appl. Sin. Engl. Ser. 26, 525–528 (2010). https://doi.org/10.1007/s10255-008-8152-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-008-8152-4
Keywords
- Graph
- covering number
- edge covering number
- independent number
- edge independent number
- total covering number
- total independent number