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

Graphs and Combinatorics最新文献

筛选
英文 中文
Parameters of Quotient-Polynomial Graphs 二次多项式图的参数
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-05-05 DOI: 10.1007/s00373-024-02789-2
Allen Herman, Roghayeh Maleki
{"title":"Parameters of Quotient-Polynomial Graphs","authors":"Allen Herman, Roghayeh Maleki","doi":"10.1007/s00373-024-02789-2","DOIUrl":"https://doi.org/10.1007/s00373-024-02789-2","url":null,"abstract":"<p>Fiol has characterized quotient-polynomial graphs as precisely the connected graphs whose adjacency matrix generates the adjacency algebra of a symmetric association scheme. We show that a collection of non-negative integer parameters of size <span>(d + frac{d(d-1)}{2})</span> is adequate for describing symmetric association schemes of class <i>d</i> that are generated by the adjacency matrix of their first non-trivial relation. We use this to generate a database of the corresponding quotient-polynomial graphs that have small valency and up to 6 classes, and among these find new feasible parameter sets for symmetric association schemes with noncyclotomic eigenvalues.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140883185","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
Ternary Extremal Four-Negacirculant Self-Dual Codes 三元极值四反循环自偶码
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-05-02 DOI: 10.1007/s00373-024-02788-3
Masaaki Harada, Keita Ishizuka, Hadi Kharaghani
{"title":"Ternary Extremal Four-Negacirculant Self-Dual Codes","authors":"Masaaki Harada, Keita Ishizuka, Hadi Kharaghani","doi":"10.1007/s00373-024-02788-3","DOIUrl":"https://doi.org/10.1007/s00373-024-02788-3","url":null,"abstract":"<p>In this note, we complete a classification of ternary extremal four-negacirculant self-dual codes of lengths 40, 44, 48, 52 and 60.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889712","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
Reduced Clique Graphs: A Correction to “Chordal Graphs and Their Clique Graphs” 还原簇图：对 "弦图及其簇图 "的更正
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-04-24 DOI: 10.1007/s00373-024-02786-5
Dillon Mayhew, Andrew Probert
{"title":"Reduced Clique Graphs: A Correction to “Chordal Graphs and Their Clique Graphs”","authors":"Dillon Mayhew, Andrew Probert","doi":"10.1007/s00373-024-02786-5","DOIUrl":"https://doi.org/10.1007/s00373-024-02786-5","url":null,"abstract":"<p>Galinier, Habib, and Paul introduced the reduced clique graph of a chordal graph <i>G</i>. The nodes of the reduced clique graph are the maximal cliques of <i>G</i>, and two nodes are joined by an edge if and only if they form a non-disjoint separating pair of cliques in <i>G</i>. In this case the weight of the edge is the size of the intersection of the two cliques. A clique tree of <i>G</i> is a tree with the maximal cliques of <i>G</i> as its nodes, where for any <span>(vin V(G))</span>, the subgraph induced by the nodes containing <i>v</i> is connected. Galinier et al. prove that a spanning tree of the reduced clique graph is a clique tree if and only if it has maximum weight, but their proof contains an error. We explain and correct this error. In addition, we initiate a study of the structure of reduced clique graphs by proving that they cannot contain any induced cycle of length five (although they may contain induced cycles of length three or any even integer greater than two). We show that no cycle of length four or more is isomorphic to a reduced clique graph. We prove that the class of clique graphs of chordal graphs is not comparable to the class of reduced clique graphs of chordal graphs by providing examples that are in each of these classes without being in the other.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140800759","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
Extremal Graph Theoretic Questions for q-Ary Vectors q-Ary 向量的极值图论问题
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-04-24 DOI: 10.1007/s00373-024-02787-4
Balázs Patkós, Zsolt Tuza, Máté Vizer
{"title":"Extremal Graph Theoretic Questions for q-Ary Vectors","authors":"Balázs Patkós, Zsolt Tuza, Máté Vizer","doi":"10.1007/s00373-024-02787-4","DOIUrl":"https://doi.org/10.1007/s00373-024-02787-4","url":null,"abstract":"<p>A <i>q</i>-graph <i>H</i> on <i>n</i> vertices is a set of vectors of length <i>n</i> with all entries from <span>({0,1,dots ,q})</span> and every vector (that we call a <i>q</i>-edge) having exactly two non-zero entries. The support of a <i>q</i>-edge <span>({textbf{x}})</span> is the pair <span>(S_{textbf{x}})</span> of indices of non-zero entries. We say that <i>H</i> is an <i>s</i>-copy of an ordinary graph <i>F</i> if <span>(|H|=|E(F)|)</span>, <i>F</i> is isomorphic to the graph with edge set <span>({S_{textbf{x}}:{textbf{x}}in H})</span>, and whenever <span>(vin e,e'in E(F))</span>, the entries with index corresponding to <i>v</i> in the <i>q</i>-edges corresponding to <i>e</i> and <span>(e')</span> sum up to at least <i>s</i>. E.g., the <i>q</i>-edges (1, 3, 0, 0, 0), (0, 1, 0, 0, 3), and (3, 0, 0, 0, 1) form a 4-triangle. The Turán number <span>(mathop {}!textrm{ex}(n,F,q,s))</span> is the maximum number of <i>q</i>-edges that a <i>q</i>-graph <i>H</i> on <i>n</i> vertices can have if it does not contain any <i>s</i>-copies of <i>F</i>. In the present paper, we determine the asymptotics of <span>(mathop {}!textrm{ex}(n,F,q,q+1))</span> for many graphs <i>F</i>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140800763","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
Computing the Number and Average Size of Connected Sets in Planar 3-Trees 计算平面 3 树中连接集的数量和平均大小
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-04-17 DOI: 10.1007/s00373-024-02783-8
Zuwen Luo, Kexiang Xu
{"title":"Computing the Number and Average Size of Connected Sets in Planar 3-Trees","authors":"Zuwen Luo, Kexiang Xu","doi":"10.1007/s00373-024-02783-8","DOIUrl":"https://doi.org/10.1007/s00373-024-02783-8","url":null,"abstract":"<p>A vertex set in a graph is a connected set if it induces a connected subgraph. For a tree <i>T</i>, each subgraph induced by a connected set of <i>T</i> is actually a subtree of <i>T</i>. The number and average size of subtrees of a tree <i>T</i> are two well-studied parameters. Yan and Yeh developed a linear-time algorithm for computing the number of subtrees in a tree through “generating function”. In this paper, we present linear-time algorithms for computing the number and average size of connected sets in a planar 3-tree.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140616153","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
Semi-strict Chordality of Digraphs 数形的半严格弦性
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-04-17 DOI: 10.1007/s00373-024-02778-5
Jing Huang, Ying Ying Ye
{"title":"Semi-strict Chordality of Digraphs","authors":"Jing Huang, Ying Ying Ye","doi":"10.1007/s00373-024-02778-5","DOIUrl":"https://doi.org/10.1007/s00373-024-02778-5","url":null,"abstract":"<p>Chordal graphs are important in structural graph theory. Chordal digraphs are a digraph analogue of chordal graphs and have been a subject of active studies recently. Unlike chordal graphs, chordal digraphs lack many structural properties such as forbidden subdigraph or representation characterizations. In this paper we introduce the notion of semi-strict chordal digraphs which form a class strictly between chordal digraphs and chordal graphs. Semi-strict chordal digraphs have rich structural properties. We characterize semi-strict chordal digraphs in terms of knotting graphs, a notion analogous to the one introduced by Gallai for the study of comparability graphs. We also give forbidden subdigraph characterizations of semi-strict chordal digraphs within the classes of locally semicomplete digraphs and weakly quasi-transitive digraphs.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140616155","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
Gallai–Ramsey Multiplicity 加莱-拉姆齐多重性
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-04-14 DOI: 10.1007/s00373-024-02780-x
Yaping Mao
{"title":"Gallai–Ramsey Multiplicity","authors":"Yaping Mao","doi":"10.1007/s00373-024-02780-x","DOIUrl":"https://doi.org/10.1007/s00373-024-02780-x","url":null,"abstract":"<p>Given two graphs <i>G</i> and <i>H</i>, the <i>general</i> <i>k</i><i>-colored Gallai–Ramsey number</i> <span>({text {gr}}_k(G:H))</span> is defined to be the minimum integer <i>m</i> such that every <i>k</i>-coloring of the complete graph on <i>m</i> vertices contains either a rainbow copy of <i>G</i> or a monochromatic copy of <i>H</i>. Interesting problems arise when one asks how many such rainbow copy of <i>G</i> and monochromatic copy of <i>H</i> must occur. The <i>Gallai–Ramsey multiplicity</i> <span>({text {GM}}_{k}(G:H))</span> is defined as the minimum total number of rainbow copy of <i>G</i> and monochromatic copy of <i>H</i> in any exact <i>k</i>-coloring of <span>(K_{{text {gr}}_{k}(G:H)})</span>. In this paper, we give upper and lower bounds for Gallai–Ramsey multiplicity involving some small rainbow subgraphs.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140578608","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
Minimal Obstructions for Polarity, Monopolarity, Unipolarity and (s, 1)-Polarity in Generalizations of Cographs 极性、单极性、单极性和 (s, 1)- 极性在 Cographs 广义中的最小障碍
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-04-09 DOI: 10.1007/s00373-024-02784-7
Fernando Esteban Contreras-Mendoza, César Hernández-Cruz
{"title":"Minimal Obstructions for Polarity, Monopolarity, Unipolarity and (s, 1)-Polarity in Generalizations of Cographs","authors":"Fernando Esteban Contreras-Mendoza, César Hernández-Cruz","doi":"10.1007/s00373-024-02784-7","DOIUrl":"https://doi.org/10.1007/s00373-024-02784-7","url":null,"abstract":"<p>It is known that every hereditary property can be characterized by finitely many minimal obstructions when restricted to either the class of cographs or the class of <span>(P_4)</span>-reducible graphs. In this work, we prove that the same is true when restricted to some other superclasses of cographs, including <span>(P_4)</span>-sparse and <span>(P_4)</span>-extendible graphs (both of which extend <span>(P_4)</span>-reducible graphs). We also present complete lists of <span>(P_4)</span>-sparse and <span>(P_4)</span>-extendible minimal obstructions for polarity, monopolarity, unipolarity, and (<i>s</i>, 1)-polarity, where <i>s</i> is a positive integer. In parallel to the case of <span>(P_4)</span>-reducible graphs, all the <span>(P_4)</span>-sparse minimal obstructions for these hereditary properties are cographs.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140579221","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 Existence of Small Strictly Neumaier Graphs 论小型严格诺伊迈尔图的存在
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-04-08 DOI: 10.1007/s00373-024-02779-4
Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker
{"title":"On the Existence of Small Strictly Neumaier Graphs","authors":"Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker","doi":"10.1007/s00373-024-02779-4","DOIUrl":"https://doi.org/10.1007/s00373-024-02779-4","url":null,"abstract":"<p>A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In particular, we present a theoretical proof of the uniqueness of the smallest strictly Neumaier graph with parameters (16, 9, 4; 2, 4), we establish the existence of a strictly Neumaier graph with parameters (25, 12, 5; 2, 5), and we disprove the existence of strictly Neumaier graphs with parameters (25, 16, 9; 3, 5), (28, 18, 11; 4, 7), (33, 24, 17; 6, 9), (35, 2212; 3, 5), (40, 30, 22; 7, 10) and (55, 34, 18; 3, 5). Our proofs use combinatorial techniques and a novel application of integer programming methods.\u0000</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140578617","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
Stability of Generalized Turán Number for Linear Forests 线性森林广义图兰数的稳定性
IF 0.7 4区 数学
Graphs and Combinatorics Pub Date : 2024-04-08 DOI: 10.1007/s00373-024-02781-w
Yisai Xue, Yichong Liu, Liying Kang
{"title":"Stability of Generalized Turán Number for Linear Forests","authors":"Yisai Xue, Yichong Liu, Liying Kang","doi":"10.1007/s00373-024-02781-w","DOIUrl":"https://doi.org/10.1007/s00373-024-02781-w","url":null,"abstract":"<p>Given a graph <i>T</i> and a family of graphs <span>({mathcal {F}})</span>, the generalized Turán number of <span>({mathcal {F}})</span> is the maximum number of copies of <i>T</i> in an <span>({mathcal {F}})</span>-free graph on <i>n</i> vertices, denoted by <span>(ex(n,T,{mathcal {F}}))</span>. A linear forest is a forest whose connected components are all paths and isolated vertices. Let <span>({mathcal {L}}_{k})</span> be the family of all linear forests of size <i>k</i> without isolated vertices. In this paper, we obtained the maximum possible number of <i>r</i>-cliques in <i>G</i>, where <i>G</i> is <span>({mathcal {L}}_{k})</span>-free with minimum degree at least <i>d</i>. Furthermore, we give a stability version of the result. As an application of the stability version of the result, we obtain a clique version of the stability of the Erdős–Gallai Theorem on matchings.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140578874","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学术官方微信