涉及控制参数的三个不等式的公共极值图

IF 0.6 Q3 MATHEMATICS Transactions on Combinatorics Pub Date : 2017-09-01 DOI:10.22108/TOC.2017.21464
V. Samodivkin
{"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}
引用次数: 2

摘要

‎设$delta(G)$‎, ‎$Delta(G)$和$gamma(G)$‎ ‎是最低学历‎, ‎最大程度和‎ ‎图$G=(V(G)‎, ‎E(G))$‎, ‎分别地‎. ‎$V(G)的分区$‎, ‎其所有类都是$G中的支配集$‎, ‎称为$G的domatic分区$‎. ‎的最大类数‎ ‎$G$的域分区称为$G的域数$‎, ‎表示为$d(G)$‎. ‎众所周知‎ ‎$d(G)leq delta(G)‎ + ‎1$‎, ‎$d(G)gamma(G)leq|V(G)|$cite{ch}‎, ‎和$|V(G)|leq(Δ(G)‎+‎1) gamma(G)$cite{berge}‎. ‎在本文中‎, ‎我们研究了图$G$‎ ‎所有上述不等式同时变为等式‎.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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‎.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.80
自引率
0.00%
发文量
2
审稿时长
30 weeks
期刊最新文献
$Kite_{p+2,p}$ is determined by its Laplacian spectrum Certain classes of complementary equienergetic graphs On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs Exponential second Zagreb index of chemical trees The $a$-number of jacobians of certain maximal curves
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1