Abstract
D.R. Woodall [7] introduced the concept of the binding number of a graphG, bind (G), and proved that bind(G)≦(|V(G)|−1)/(|V(G)|−ρ(G)). In this paper, some properties of a graph with bind(G)=(|V(G)|−1)/(|V(G)|−ρ(G)) are given, and the binding number of some line graphs and total graphs are determined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Harary, F.: Graph Theory. Reading: Addison-Wesley 1969
Kane, V.G., Mohanty, S.P., Hales, H.S.: Product graphs and binding numbers. Ars Comb.11, 201–224 (1981)
Liu, J., Tian, S., Wang, J.: The binding number of strong cartesian product of some special graphs (to appear)
Tian, S., Wang, J., Liu, J.: The binding number of the tensor product of some graphs (to appear)
Wang, J., Tian, S., Liu, J.: The binding number of product graph. In: Graph Theory: Lecture Notes in Mathematics 1073, pp. 119–128. Berlin-Heidelberg-New York-Tokyo: Springer-Verlag 1983
Wang, J., Tian, S., Liu, J.: The binding number of lexicographic product of graphs (to appear)
Woodall, D.R.: The binding number of a graph and its Anderson number. J. Comb. Theory (B)15, 225–255 (1973)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Saito, A., Songlin, T. The binding number of line graphs and total graphs. Graphs and Combinatorics 1, 351–356 (1985). https://doi.org/10.1007/BF02582963
Issue Date:
DOI: https://doi.org/10.1007/BF02582963