• Surekha R Bhat
• R.S Bhat

Vizing in 1965 providede an upper bound for the number of edges in terms of domination number and is popular as Vizing Theorem. In this paper we find a bound on the number of edges in a simple graph when the maximum degree  (minimum degree ) is given. This result corresponds to the well known theorem of Vizing. We have characterized the graphs for which these bounds are attained. We also give a lower bound for  in terms of order and size of the graph.

Maximum degree , Minimum degree delta, Partially complete (p, delta) graph, k-semiregular graph.

"A VIZING TYPE THEOREM ON MAXIMUM AND MINIMUM DEGREE OF A GRAPH", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.10, Issue 3, page no.f716-f719, March-2023, Available :http://www.jetir.org/papers/JETIR2303595.pdf

"A VIZING TYPE THEOREM ON MAXIMUM AND MINIMUM DEGREE OF A GRAPH", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.10, Issue 3, page no. ppf716-f719, March-2023, Available at : http://www.jetir.org/papers/JETIR2303595.pdf