发布求助
文献互助 智能选刊 最新文献

Discussiones Mathematicae Graph Theory最新文献

筛选
英文 中文
Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree 相邻顶点强区分平均度较低的图的全着色
4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2518
Fei Wen, Li Zhou, Zepeng Li
{"title":"Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree","authors":"Fei Wen, Li Zhou, Zepeng Li","doi":"10.7151/dmgt.2518","DOIUrl":"https://doi.org/10.7151/dmgt.2518","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135700693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Turán number of three disjoint paths Turán三条不相交路径的个数
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2507
Jin Deng, Jianfeng Hou, Qinghou Zeng
{"title":"The Turán number of three disjoint paths","authors":"Jin Deng, Jianfeng Hou, Qinghou Zeng","doi":"10.7151/dmgt.2507","DOIUrl":"https://doi.org/10.7151/dmgt.2507","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71129992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Biregular (and regular) planar cages 双规则(和规则)平面笼
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2425
G. Araujo-Pardo, F. Barrera-Cruz, N. Garcia-Colin
{"title":"Biregular (and regular) planar cages","authors":"G. Araujo-Pardo, F. Barrera-Cruz, N. Garcia-Colin","doi":"10.7151/dmgt.2425","DOIUrl":"https://doi.org/10.7151/dmgt.2425","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"14 1","pages":"1171-1194"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81652798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the distribution of distance signless Laplacian eigenvalues with given independence and chromatic number 给定独立性和色数的距离无符号拉普拉斯特征值的分布
4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2524
Shariefuddin Pirzada, Saleem Khan, Francesco Belardo
{"title":"On the distribution of distance signless Laplacian eigenvalues with given independence and chromatic number","authors":"Shariefuddin Pirzada, Saleem Khan, Francesco Belardo","doi":"10.7151/dmgt.2524","DOIUrl":"https://doi.org/10.7151/dmgt.2524","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135057583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Online size Ramsey number for C4 and P6 C4和P6的在线尺寸拉姆齐号码
4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2513
Mateusz Litka
{"title":"Online size Ramsey number for <i>C<sub>4</sub></i> and <i>P<sub>6</sub></i>","authors":"Mateusz Litka","doi":"10.7151/dmgt.2513","DOIUrl":"https://doi.org/10.7151/dmgt.2513","url":null,"abstract":"In this paper we consider a game played on the edge set of the infinite clique $K_mathbb{N}$ by two players, Builder and Painter. In each round of the game, Builder chooses an edge and Painter colors it red or blue. Builder wins when Painter creates a red copy of $G$ or a blue copy of $H$, for some fixed graphs $G$ and $H$. Builder wants to win in as few rounds as possible, and Painter wants to delay Builder for as many rounds as possible. The online size Ramsey number $tilde{r}(G,H)$, is the minimum number of rounds within which Builder can win, assuming both players play optimally. So far it has been proven by Dybizba'nski, Dzido and Zakrzewska that $11leqtilde{r}(C_4,P_6)leq13$ cite{Dzido}. In this paper, we refine this result and show the exact value, namely we will present the Theorem that $tilde{r}(C_4,P_6)=11$, with the details of the proof. Keywords: graph theory, Ramsey theory, combinatorial games, online size Ramsey number","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135442103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Corrigendum to "Minimum edge cuts in diameter 2 graphs" “直径2图的最小切边量”的勘误表
4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2517
Allan Bickle, Allen Schwenk
{"title":"Corrigendum to \"Minimum edge cuts in diameter 2 graphs\"","authors":"Allan Bickle, Allen Schwenk","doi":"10.7151/dmgt.2517","DOIUrl":"https://doi.org/10.7151/dmgt.2517","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135700692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Critical aspects in broadcast domination 广播统治的关键方面
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2506
Jishnu Sen, S. Kola
{"title":"Critical aspects in broadcast domination","authors":"Jishnu Sen, S. Kola","doi":"10.7151/dmgt.2506","DOIUrl":"https://doi.org/10.7151/dmgt.2506","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71129976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The tree-achieving set and non-separating independent set problem of subcubic graphs 次三次图的树成集和不可分离独立集问题
4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2522
Fayun Cao, Han Ren
{"title":"The tree-achieving set and non-separating independent set problem of subcubic graphs","authors":"Fayun Cao, Han Ren","doi":"10.7151/dmgt.2522","DOIUrl":"https://doi.org/10.7151/dmgt.2522","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136301686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The maximum number of edges in a {Kr+1,Mk+1}-free graph {Kr+1,Mk+1}自由图的最大边数
4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2515
Lingting Fu, Jian Wang, Weihua Yang
{"title":"The maximum number of edges in a <i>{K<sub>r+1</sub>,M<sub>k+1</sub>}</i>-free graph","authors":"Lingting Fu, Jian Wang, Weihua Yang","doi":"10.7151/dmgt.2515","DOIUrl":"https://doi.org/10.7151/dmgt.2515","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135556670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The walks and CDC of graphs with the same main eigenspace 具有相同主特征空间的图的walk和CDC
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2386
Irene Sciriha, Luke Collins
{"title":"The walks and CDC of graphs with the same main eigenspace","authors":"Irene Sciriha, Luke Collins","doi":"10.7151/dmgt.2386","DOIUrl":"https://doi.org/10.7151/dmgt.2386","url":null,"abstract":"The main eigenvalues of a graph G are those eigenvalues of the (0, 1)adjacency matrix A with a corresponding eigenspace not orthogonal to j = (1 | 1 | · · · | 1). The principal main eigenvector associated with a main eigenvalue is the orthogonal projection of the corresponding eigenspace onto j. The main eigenspace of a graph is generated by all the principal main eigenvectors and is the same as the image of the walk matrix. We explore a new concept to see to what extent the main eigenspace determines the entries of the walk matrix of a graph. The CDC of a graph G is the direct product G ×K2. We establish a hierarchy of inclusions connecting classes of graphs in view of their CDC, walk matrix, main eigenvalues and main eigenspaces. We provide a new proof that graphs with the same CDC are characterized as TF-isomorphic graphs. A complete list of TF-isomorphic graphs on at most 8 vertices and their common CDC is also given.","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"22 1","pages":"507-532"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73706417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信