线形图中的存在性封闭

IF 0.6 4区数学 Q3 MATHEMATICS 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":"线形图中的存在性封闭","authors":"Andrea C. Burgess, Robert D. Luther, David A. Pike","doi":"10.1007/s00373-024-02829-x","DOIUrl":null,"url":null,"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.","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":\"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.\",\"PeriodicalId\":12811,\"journal\":{\"name\":\"Graphs and Combinatorics\",\"volume\":null,\"pages\":null},\"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}","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

摘要

如果对于所有具有 $|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 的构造。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

摘要图片

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Existential Closure in Line Graphs

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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.

期刊最新文献

An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth Existential Closure in Line Graphs The Planar Turán Number of $$\{K_4,C_5\}$$ and $$\{K_4,C_6\}$$ On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree New Tools to Study 1-11-Representation of Graphs