{"title":"涉及控制参数的三个不等式的公共极值图","authors":"V. Samodivkin","doi":"10.22108/TOC.2017.21464","DOIUrl":null,"url":null,"abstract":"Let $delta (G)$, $Delta (G)$ and $gamma(G)$ be the minimum degree, maximum degree and domination number of a graph $G=(V(G), E(G))$, respectively. A partition of $V(G)$, all of whose classes are dominating sets in $G$, is called a domatic partition of $G$. The maximum number of classes of a domatic partition of $G$ is called the domatic number of $G$, denoted $d(G)$. It is well known that $d(G) leq delta(G) + 1$, $d(G)gamma(G) leq |V(G)|$ cite{ch}, and $|V(G)| leq (Delta(G)+1)gamma(G)$ cite{berge}. In this paper, we investigate the graphs $G$ for which all the above inequalities become simultaneously equalities.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"6 1","pages":"1-9"},"PeriodicalIF":0.6000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Common extremal graphs for three inequalities involving domination parameters\",\"authors\":\"V. Samodivkin\",\"doi\":\"10.22108/TOC.2017.21464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $delta (G)$, $Delta (G)$ and $gamma(G)$ be the minimum degree, maximum degree and domination number of a graph $G=(V(G), E(G))$, respectively. A partition of $V(G)$, all of whose classes are dominating sets in $G$, is called a domatic partition of $G$. The maximum number of classes of a domatic partition of $G$ is called the domatic number of $G$, denoted $d(G)$. It is well known that $d(G) leq delta(G) + 1$, $d(G)gamma(G) leq |V(G)|$ cite{ch}, and $|V(G)| leq (Delta(G)+1)gamma(G)$ cite{berge}. In this paper, we investigate the graphs $G$ for which all the above inequalities become simultaneously equalities.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"6 1\",\"pages\":\"1-9\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2017.21464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2017.21464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Common extremal graphs for three inequalities involving domination parameters
Let $delta (G)$, $Delta (G)$ and $gamma(G)$ be the minimum degree, maximum degree and domination number of a graph $G=(V(G), E(G))$, respectively. A partition of $V(G)$, all of whose classes are dominating sets in $G$, is called a domatic partition of $G$. The maximum number of classes of a domatic partition of $G$ is called the domatic number of $G$, denoted $d(G)$. It is well known that $d(G) leq delta(G) + 1$, $d(G)gamma(G) leq |V(G)|$ cite{ch}, and $|V(G)| leq (Delta(G)+1)gamma(G)$ cite{berge}. In this paper, we investigate the graphs $G$ for which all the above inequalities become simultaneously equalities.