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

Graphs and Combinatorics最新文献

筛选
英文 中文
Existential Closure in Line Graphs 线形图中的存在性封闭
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-22 DOI: 10.1007/s00373-024-02829-x
Andrea C. Burgess, Robert D. Luther, David A. Pike
{"title":"Existential Closure in Line Graphs","authors":"Andrea C. Burgess, Robert D. Luther, David A. Pike","doi":"10.1007/s00373-024-02829-x","DOIUrl":"https://doi.org/10.1007/s00373-024-02829-x","url":null,"abstract":"<p>A graph is <i>n</i>-<i>existentially closed</i> if, for all disjoint sets of vertices <i>A</i> and <i>B</i> with <span>(|Acup B|=n)</span>, there is a vertex <i>z</i> not in <span>(Acup B)</span> adjacent to each vertex of <i>A</i> and to no vertex of <i>B</i>. In this paper, we investigate <i>n</i>-existentially closed line graphs. In particular, we present necessary conditions for the existence of such graphs as well as constructions for finding infinite families of such graphs. We also prove that there are exactly five 2-existentially closed planar line graphs. We then consider the existential closure of the line graphs of hypergraphs and present constructions for 2-existentially closed line graphs of hypergraphs.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"30 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224305","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
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth 计算有界树宽图中韧性的高效算法
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-22 DOI: 10.1007/s00373-024-02828-y
Gyula Y. Katona, Humara Khan
{"title":"An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth","authors":"Gyula Y. Katona, Humara Khan","doi":"10.1007/s00373-024-02828-y","DOIUrl":"https://doi.org/10.1007/s00373-024-02828-y","url":null,"abstract":"<p>Let <i>t</i> be a positive real number. A graph is called <i>t</i>-<i>tough</i> if the removal of any vertex set <i>S</i> that disconnects the graph leaves at most |<i>S</i>|/<i>t</i> components. The toughness of a graph is the largest <i>t</i> for which the graph is <i>t</i>-tough. We prove that toughness is fixed-parameter tractable parameterized with the treewidth. More precisely, we give an algorithm to compute the toughness of a graph <i>G</i> with running time <span>({mathcal {O}}(|V(G)|^3cdot textrm{tw}(G)^{2textrm{tw}(G)}))</span> where <span>(textrm{tw}(G))</span> is the treewidth. If the treewidth is bounded by a constant, then this is a polynomial algorithm.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142185932","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 Planar Turán Number of $${K_4,C_5}$$ and $${K_4,C_6}$$ $${K_4,C_5}$ 和 $${K_4,C_6}$ 的平面图兰数
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-18 DOI: 10.1007/s00373-024-02830-4
Ervin Győri, Alan Li, Runtian Zhou
{"title":"The Planar Turán Number of $${K_4,C_5}$$ and $${K_4,C_6}$$","authors":"Ervin Győri, Alan Li, Runtian Zhou","doi":"10.1007/s00373-024-02830-4","DOIUrl":"https://doi.org/10.1007/s00373-024-02830-4","url":null,"abstract":"<p>Let <span>(mathcal {H})</span> be a set of graphs. The planar Turán number, <span>(ex_mathcal {P}(n,mathcal {H}))</span>, is the maximum number of edges in an <i>n</i>-vertex planar graph which does not contain any member of <span>(mathcal {H})</span> as a subgraph. When <span>(mathcal {H}={H})</span> has only one element, we usually write <span>(ex_mathcal {P}(n,H))</span> instead. The study of extremal planar graphs was initiated by Dowden (J Graph Theory 83(3):213–230, 2016). He obtained sharp upper bounds for both <span>(ex_mathcal {P}(n,C_5))</span> and <span>(ex_mathcal {P}(n,K_4))</span>. Later on, sharp upper bounds were proved for <span>(ex_mathcal {P}(n,C_6))</span> and <span>(ex_mathcal {P}(n,C_7))</span>. In this paper, we show that <span>(ex_mathcal {P}(n,{K_4,C_5})le {15over 7}(n-2))</span> and <span>(ex_mathcal {P}(n,{K_4,C_6})le {7over 3}(n-2))</span>. We also give constructions which show the bounds are sharp for infinitely many <i>n</i>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"159 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142185937","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 Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree 论小度无爪图中局部公平着色的复杂性
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-16 DOI: 10.1007/s00373-024-02826-0
Zuosong Liang
{"title":"On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree","authors":"Zuosong Liang","doi":"10.1007/s00373-024-02826-0","DOIUrl":"https://doi.org/10.1007/s00373-024-02826-0","url":null,"abstract":"<p>An <i>equitable </i><i>k</i><i>-partition </i>(<span>(kge 2)</span>) of a vertex set <i>S</i> is a partition of <i>S</i> into <i>k</i> subsets (may be empty sets) such that the sizes of any two subsets of <i>S</i> differ by at most one. A <i>local-equitable k-coloring </i>(<span>(kge 2)</span>) of <i>G</i> is an assignment of <i>k</i> colors to the vertices of <i>G</i> such that, for every maximal clique <i>H</i> of <i>G</i>, the coloring on <i>H</i> forms an equitable <i>k</i>-partition of <i>H</i>. Local-equitable coloring of graphs is a generalization of the proper vertex coloring of graphs and also a stronger version of clique-coloring of graphs. Claw-free graphs with maximum degree four are proved to be 2-clique-colorable [Discrete Math. Theoret. Comput. Sci. 11 (2) (2009), 15–24] but not necessary local-equitably 2-colorable. In this paper, given a claw-free graph <i>G</i> with maximum degree at most four, we present a linear time algorithm to give a local-equitable 2-coloring of <i>G</i> or decide that <i>G</i> is not local-equitably 2-colorable. As a corollary, we get that claw-free perfect graphs with maximum degree at most four are local-equitably 2-colorable.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142185851","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
New Tools to Study 1-11-Representation of Graphs 研究 1-11 的新工具--图形表示法
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-14 DOI: 10.1007/s00373-024-02825-1
Mikhail Futorny, Sergey Kitaev, Artem Pyatkin
{"title":"New Tools to Study 1-11-Representation of Graphs","authors":"Mikhail Futorny, Sergey Kitaev, Artem Pyatkin","doi":"10.1007/s00373-024-02825-1","DOIUrl":"https://doi.org/10.1007/s00373-024-02825-1","url":null,"abstract":"<p>The notion of a <i>k</i>-11-representable graph was introduced by Jeff Remmel in 2017 and studied by Cheon et al. in 2019 as a natural extension of the extensively studied notion of word-representable graphs, which are precisely 0-11-representable graphs. A graph <i>G</i> is <i>k</i>-11-representable if it can be represented by a word <i>w</i> such that for any edge (resp., non-edge) <i>xy</i> in <i>G</i> the subsequence of <i>w</i> formed by <i>x</i> and <i>y</i> contains at most <i>k</i> (resp., at least <span>(k+1)</span>) pairs of consecutive equal letters. A remarkable result of Cheon at al. is that <i>any</i> graph is 2-11-representable, while it is unknown whether every graph is 1-11-representable. Cheon et al. showed that the class of 1-11-representable graphs is strictly larger than that of word-representable graphs, and they introduced a useful toolbox to study 1-11-representable graphs. In this paper, we introduce new tools for studying 1-11-representation of graphs. We apply them for establishing 1-11-representation of Chvátal graph, Mycielski graph, split graphs, and graphs whose vertices can be partitioned into a comparability graph and an independent set.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"7 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142185855","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 Vertex Arboricity of 1-Planar Graphs 单平面图形的顶点有性
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-08 DOI: 10.1007/s00373-024-02820-6
Dongdong Zhang, Juan Liu, Yongjie Li, Hehua Yang
{"title":"The Vertex Arboricity of 1-Planar Graphs","authors":"Dongdong Zhang, Juan Liu, Yongjie Li, Hehua Yang","doi":"10.1007/s00373-024-02820-6","DOIUrl":"https://doi.org/10.1007/s00373-024-02820-6","url":null,"abstract":"<p>The vertex arboricity <i>a</i>(<i>G</i>) of a graph <i>G</i> is the minimum number of colors required to color the vertices of <i>G</i> such that no cycle is monochromatic. A graph <i>G</i> is 1-planar if it can be drawn in the plane so that each edge has at most one crossing. In this paper, we proved that every 1-planar graph without 5-cycles has minimum degree at most 5; Every 1-planar graph of girth at least 7 has minimum degree at most 3. The following conclusions can be obtained by combining the existing conclusions and our proofs: if <i>G</i> is a 1-planar graph without 5-cycles, then <span>(a(G)le 3)</span>; if <i>G</i> is a 1-planar graph with <span>(g(G)ge 7)</span>, then <span>(a(G)le 2)</span>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"10 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141948477","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
Maximal Colourings for Graphs 图形的最大着色
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-07 DOI: 10.1007/s00373-024-02823-3
Raffaella Mulas
{"title":"Maximal Colourings for Graphs","authors":"Raffaella Mulas","doi":"10.1007/s00373-024-02823-3","DOIUrl":"https://doi.org/10.1007/s00373-024-02823-3","url":null,"abstract":"<p>We consider two different notions of graph colouring, namely, the <i>t</i>-periodic colouring for vertices that has been introduced in 1974 by Bondy and Simonovits, and the periodic colouring for oriented edges that has been recently introduced in the context of spectral theory of non-backtracking operators. For each of these two colourings, we introduce the corresponding colouring number which is given by maximising the possible number of colours. We first investigate these two new colouring numbers individually, and we then show that there is a deep relationship between them.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"5 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141948476","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
Independence Number and Maximal Chromatic Polynomials of Connected Graphs 连通图的独立数和最大色度多项式
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-07 DOI: 10.1007/s00373-024-02824-2
Shude Long, Junliang Cai
{"title":"Independence Number and Maximal Chromatic Polynomials of Connected Graphs","authors":"Shude Long, Junliang Cai","doi":"10.1007/s00373-024-02824-2","DOIUrl":"https://doi.org/10.1007/s00373-024-02824-2","url":null,"abstract":"<p>Let <span>({mathcal {C}}_{k}(n))</span> denote the family of all connected graphs of order <i>n</i> with chromatic number <i>k</i>. In this paper we show that the conjecture proposed by Tomescu which if <span>(xge kge 4)</span> and <span>(Gin {mathcal {C}}_{k}(n))</span>, then </p><span>$$begin{aligned} P(G,x)le (x)_{k} (x-1)^{n-k} end{aligned}$$</span><p>holds under the additional condition that <i>G</i> has an independent cut-set <i>T</i> of size at most 2 such that the number of components in <span>(G{setminus } T)</span> is equal to the independence number of <i>G</i>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"83 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141948479","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
Ramsey Numbers of Multiple Copies of Graphs in a Component 组件中多个图形副本的拉姆齐数
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-07 DOI: 10.1007/s00373-024-02821-5
Caixia Huang, Yuejian Peng, Yiran Zhang
{"title":"Ramsey Numbers of Multiple Copies of Graphs in a Component","authors":"Caixia Huang, Yuejian Peng, Yiran Zhang","doi":"10.1007/s00373-024-02821-5","DOIUrl":"https://doi.org/10.1007/s00373-024-02821-5","url":null,"abstract":"<p>For a graph <i>G</i>, let <span>(R({mathcal {C}}(nG)))</span> denote the least <i>N</i> such that every 2-colouring of the edges of <span>(K_N)</span> contains a monochromatic copy of <i>nG</i> in a monochromatic connected subgraph, where <i>nG</i> denotes <i>n</i> vertex disjoint copies of <i>G</i>. Gyárfás and Sárközy (J Graph Theory 83(2):109–119, 2016) showed that <span>(R({mathcal {C}}(nK_3))=7n-2)</span> for <span>(n ge 2)</span>. After that, Roberts (Electron J Comb 24(1):8, 2017)showed that <span>(R({mathcal {C}}(nK_r))=(r^2-r+1)n-r+1)</span> for <span>(r ge 4)</span> and <span>(n ge R(K_r))</span>, where <span>(R(K_r))</span> is the Ramsey number of <span>(K_r)</span>. In this paper, we determine <span>(R({mathcal {C}}(nG)))</span> for all 4-vertex graphs <i>G</i> without isolated vertices.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"19 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141948478","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
Normalized Laplacian Eigenvalues of Hypergraphs 超图的归一化拉普拉奇特征值
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-08-03 DOI: 10.1007/s00373-024-02815-3
Leyou Xu, Bo Zhou
{"title":"Normalized Laplacian Eigenvalues of Hypergraphs","authors":"Leyou Xu, Bo Zhou","doi":"10.1007/s00373-024-02815-3","DOIUrl":"https://doi.org/10.1007/s00373-024-02815-3","url":null,"abstract":"<p>In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are related to the normalized Laplacian eigenvalues for uniform hypergraphs.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"30 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969775","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
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信