完全多部图的区间边着色

Levon N. Muradyan
{"title":"完全多部图的区间边着色","authors":"Levon N. Muradyan","doi":"10.46991/pysu:a/2022.56.1.019","DOIUrl":null,"url":null,"abstract":"A graph $G$ is called a complete $r$-partite $(r\\geq 2)$ graph, if its vertices can be divided into $r$ non-empty independent sets $V_1,\\ldots,V_r$ in a way that each vertex in $V_i$ is adjacent to all the other vertices in $V_j$ for $1\\leq i<j\\leq r$. Let $K_{n_{1},n_{2},\\ldots,n_{r}}$ denote a complete $r$-partite graph with independent sets $V_1,V_2,\\ldots,V_r$ of sizes $n_{1},n_{2},\\ldots,n_{r}$. An edge-coloring of a graph $G$ with colors $1,2,\\ldots,t$ is called an \\emph{interval $t$-coloring}, if all colors are used and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. In this paper we have obtained some results on the existence and construction of interval edge-colorings of complete $r$-partite graphs. Moreover, we have also derived an upper bound on the number of colors in interval colorings of complete multipartite graphs.","PeriodicalId":21146,"journal":{"name":"Proceedings of the YSU A: Physical and Mathematical Sciences","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ON INTERVAL EDGE-COLORINGS OF COMPLETE MULTIPARTITE GRAPHS\",\"authors\":\"Levon N. Muradyan\",\"doi\":\"10.46991/pysu:a/2022.56.1.019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph $G$ is called a complete $r$-partite $(r\\\\geq 2)$ graph, if its vertices can be divided into $r$ non-empty independent sets $V_1,\\\\ldots,V_r$ in a way that each vertex in $V_i$ is adjacent to all the other vertices in $V_j$ for $1\\\\leq i<j\\\\leq r$. Let $K_{n_{1},n_{2},\\\\ldots,n_{r}}$ denote a complete $r$-partite graph with independent sets $V_1,V_2,\\\\ldots,V_r$ of sizes $n_{1},n_{2},\\\\ldots,n_{r}$. An edge-coloring of a graph $G$ with colors $1,2,\\\\ldots,t$ is called an \\\\emph{interval $t$-coloring}, if all colors are used and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. In this paper we have obtained some results on the existence and construction of interval edge-colorings of complete $r$-partite graphs. Moreover, we have also derived an upper bound on the number of colors in interval colorings of complete multipartite graphs.\",\"PeriodicalId\":21146,\"journal\":{\"name\":\"Proceedings of the YSU A: Physical and Mathematical Sciences\",\"volume\":\"12 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the YSU A: Physical and Mathematical Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46991/pysu:a/2022.56.1.019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the YSU A: Physical and Mathematical Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46991/pysu:a/2022.56.1.019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

图$G$被称为完全$r$ -部$(r\geq 2)$图,如果它的顶点可以被分成$r$非空独立集$V_1,\ldots,V_r$,并且$V_i$中的每个顶点与$V_j$中的所有其他顶点相邻,对于$1\leq i本文章由计算机程序翻译,如有差异,请以英文原文为准。
分享
查看原文 本刊更多论文
ON INTERVAL EDGE-COLORINGS OF COMPLETE MULTIPARTITE GRAPHS
A graph $G$ is called a complete $r$-partite $(r\geq 2)$ graph, if its vertices can be divided into $r$ non-empty independent sets $V_1,\ldots,V_r$ in a way that each vertex in $V_i$ is adjacent to all the other vertices in $V_j$ for $1\leq i
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信