Existential Closure in Line Graphs

IF 0.6 4区 数学 Q3 MATHEMATICS
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":null,"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>\\(|A\\cup B|=n\\)</span>, there is a vertex <i>z</i> not in <span>\\(A\\cup 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.6000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-024-02829-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A graph is n-existentially closed if, for all disjoint sets of vertices A and B with \(|A\cup B|=n\), there is a vertex z not in \(A\cup B\) adjacent to each vertex of A and to no vertex of B. In this paper, we investigate n-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.

Abstract Image

线形图中的存在性封闭
如果对于所有具有 \(|A\cup B|=n\) 的顶点集 A 和 B,有一个不在\(A/cup B\) 中的顶点 z 与 A 的每个顶点相邻,并且与 B 的任何顶点都不相邻,那么这个图就是 n-existentially closed。特别是,我们提出了这种图存在的必要条件,以及找到这种图无限族的构造。我们还证明了正好有五个 2-existent closed 平面线图。然后,我们考虑了超图的线图的存在封闭性,并提出了 2-existentially closed line graphs of hypergraphs 的构造。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Graphs and Combinatorics
Graphs and Combinatorics 数学-数学
CiteScore
1.00
自引率
14.30%
发文量
160
审稿时长
6 months
期刊介绍: Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.
×
引用
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学术官方微信