7 research outputs found
Common extremal graphs for three inequalities involving domination parameters
‎Let ‎, ‎ and ‎ ‎be the minimum degree‎, ‎maximum degree and‎ ‎domination number of a graph ‎, ‎respectively‎. ‎A partition of ‎, ‎all of whose classes are dominating sets in ‎, ‎is called a domatic partition of ‎. ‎The maximum number of classes of‎ ‎a domatic partition of is called the domatic number of ‎, ‎denoted ‎. ‎It is well known that‎ ‎‎, ‎ cite{ch}‎, ‎and cite{berge}‎. ‎In this paper‎, ‎we investigate the graphs for which‎ ‎all the above inequalities become simultaneously equalities‎
Ohio State University Bulletin
Classes available for students to enroll in during the 1986-1987 academic year for The Ohio State University
Ohio State University Bulletin
Classes available for students to enroll in during the 1985-1986 academic year for The Ohio State University