Another upper bound for the domination number of a graph
Keywords:
Upper limit, number of domination graph (es)
Downloads
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its domination number B(G), we show that B(G) ≤ [(n-∆-1) (n- δ-2)/(n-1)]+2.
How to Cite
APA
ACM
ACS
ABNT
Chicago
Harvard
IEEE
MLA
Turabian
Vancouver
Download Citation
Article abstract page views
Downloads
License
Copyright (c) 1986 Revista Colombiana de Matemáticas
This work is licensed under a Creative Commons Attribution 4.0 International License.