首页 > 最新文献

Graphs and Combinatorics最新文献

英文 中文
Cliques of Orders Three and Four in the Paley-Type Graphs 帕利型图中的三阶和四阶小群
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2024-06-24 DOI: 10.1007/s00373-024-02809-1
Anwita Bhowmik, Rupam Barman

Let (n=2^s p_{1}^{alpha _{1}}cdots p_{k}^{alpha _{k}}), where (s=0) or 1, (alpha _ige 1), and the distinct primes (p_i) satisfy (p_iequiv 1pmod {4}) for all (i=1, ldots , k). Let (mathbb {Z}_n^*) denote the group of units in the commutative ring (mathbb {Z}_n). In a recent paper, we defined the Paley-type graph (G_n) of order n as the graph whose vertex set is (mathbb {Z}_n) and xy is an edge if (x-yequiv a^2pmod n) for some (ain mathbb {Z}_n^*). Computing the number of cliques of a particular order in a Paley graph or its generalizations has been of considerable interest. In our recent paper, for primes (pequiv 1pmod 4) and (alpha ge 1), by evaluating certain character sums, we found the number of cliques of order 3 in (G_{p^alpha }) and expressed the number of cliques of order 4 in (G_{p^alpha }) in terms of Jacobi sums. In this article we give combinatorial proofs and find the number of cliques of orders 3 and 4 in (G_n) for all n for which the graph is defined.

让(n=2^s p_{1}^{alpha _{1}}cdots p_{k}^{alpha _{k}} ),其中(s=0)或1,(alpha _ige 1 ),以及对于所有(i=1, ldots , k )的不同素数(p_i)满足(p_i/equiv 1pmod {4}/)。让 (mathbb {Z}_n^*) 表示交换环 (mathbb {Z}_n) 中的单元群。在最近的一篇论文中,我们把阶数为 n 的帕利型图(Paley-type graph (G_n))定义为顶点集为 (mathbb {Z}_n) 的图,如果对于某个 (ain mathbb {Z}_n^*) 来说 (x-yequiv a^2pmod n) xy 是一条边,那么 (x-yequiv a^2pmod n) xy 就是一条边。计算帕利图或其广义图中特定阶的小群数一直是人们相当感兴趣的问题。在我们最近的论文中,对于素数 (pequiv 1pmod 4) 和 (alpha ge 1) ,通过评估某些特征和,我们发现了 (G_{p^alpha }) 中阶数为 3 的小群数,并用雅可比和表达了 (G_{p^alpha }) 中阶数为 4 的小群数。在这篇文章中,我们给出了组合证明,并找到了对于所有 n 定义了图形的 (G_n) 中 3 阶和 4 阶小块的数量。
{"title":"Cliques of Orders Three and Four in the Paley-Type Graphs","authors":"Anwita Bhowmik, Rupam Barman","doi":"10.1007/s00373-024-02809-1","DOIUrl":"https://doi.org/10.1007/s00373-024-02809-1","url":null,"abstract":"<p>Let <span>(n=2^s p_{1}^{alpha _{1}}cdots p_{k}^{alpha _{k}})</span>, where <span>(s=0)</span> or 1, <span>(alpha _ige 1)</span>, and the distinct primes <span>(p_i)</span> satisfy <span>(p_iequiv 1pmod {4})</span> for all <span>(i=1, ldots , k)</span>. Let <span>(mathbb {Z}_n^*)</span> denote the group of units in the commutative ring <span>(mathbb {Z}_n)</span>. In a recent paper, we defined the Paley-type graph <span>(G_n)</span> of order <i>n</i> as the graph whose vertex set is <span>(mathbb {Z}_n)</span> and <i>xy</i> is an edge if <span>(x-yequiv a^2pmod n)</span> for some <span>(ain mathbb {Z}_n^*)</span>. Computing the number of cliques of a particular order in a Paley graph or its generalizations has been of considerable interest. In our recent paper, for primes <span>(pequiv 1pmod 4)</span> and <span>(alpha ge 1)</span>, by evaluating certain character sums, we found the number of cliques of order 3 in <span>(G_{p^alpha })</span> and expressed the number of cliques of order 4 in <span>(G_{p^alpha })</span> in terms of Jacobi sums. In this article we give combinatorial proofs and find the number of cliques of orders 3 and 4 in <span>(G_n)</span> for all <i>n</i> for which the graph is defined.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141505150","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
Partitions of Vertices and Facets in Trees and Stacked Simplicial Complexes 树和堆叠简复中顶点和面的分区
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2024-06-18 DOI: 10.1007/s00373-024-02804-6
Gunnar Fløystad

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes with their triangulations), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into independent sets. More generally, we give bijections between facet partitions whose parts have minimal distance (ge s) and vertex partitions whose parts have minimal distance (ge s+1).

对于堆叠单纯形复合体(其特殊子类有:树、多边形的三角剖分、堆叠多面体及其三角剖分),我们给出了面的分割(对于树:边)与顶点分割成独立集之间的明确双射。更一般地说,我们给出了部分具有最小距离(ge s)的面分割和部分具有最小距离(ge s+1)的顶点分割之间的双射。
{"title":"Partitions of Vertices and Facets in Trees and Stacked Simplicial Complexes","authors":"Gunnar Fløystad","doi":"10.1007/s00373-024-02804-6","DOIUrl":"https://doi.org/10.1007/s00373-024-02804-6","url":null,"abstract":"<p>For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes with their triangulations), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into independent sets. More generally, we give bijections between facet partitions whose parts have minimal distance <span>(ge s)</span> and vertex partitions whose parts have minimal distance <span>(ge s+1)</span>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141529213","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
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan 图的生成树的枢轴灰色代码英尺扇形
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2024-06-11 DOI: 10.1007/s00373-024-02808-2
Ben Cameron, Aaron Grubb, Joe Sawada

We consider the problem of listing all spanning trees of a graph G such that successive trees differ by pivoting a single edge around a vertex. Such a listing is called a “pivot Gray code”, and it has more stringent conditions than known “revolving-door” Gray codes for spanning trees. Most revolving-door algorithms employ a standard edge-deletion/edge-contraction recursive approach which we demonstrate presents natural challenges when requiring the “pivot” property. Our main result is the discovery of a greedy strategy to list the spanning trees of the fan graph in a pivot Gray code order. It is the first greedy algorithm for exhaustively generating spanning trees using such a minimal change operation. The resulting listing is then studied to find a recursive algorithm that produces the same listing in O(1)-amortized time using O(n) space. Additionally, we present O(n)-time algorithms for ranking and unranking the spanning trees for our listing. Finally, we discuss how our listing can be applied to find a pivot Gray code for the wheel graph.

我们考虑的问题是,如何列出图 G 的所有生成树,使得连续的生成树通过在一个顶点周围旋转一条边而有所不同。这种列表被称为 "枢轴灰色编码",它比已知的生成树 "旋转门 "灰色编码有更严格的条件。大多数旋转门算法都采用标准的边删除/边收缩递归方法,我们证明了这种方法在要求 "枢轴 "属性时所面临的自然挑战。我们的主要成果是发现了一种贪婪策略,可以按照中枢灰色代码顺序列出扇形图的生成树。这是第一种利用最小变化操作穷举生成生成树的贪婪算法。然后,通过研究生成的列表,我们找到了一种递归算法,它能在 O(1)-amortized 时间内使用 O(n) 空间生成相同的列表。此外,我们还提出了在 O(n) 时间内对列表中的生成树进行排序和取消排序的算法。最后,我们还讨论了如何将我们的列表应用于寻找轮子图的枢轴灰色代码。
{"title":"Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan","authors":"Ben Cameron, Aaron Grubb, Joe Sawada","doi":"10.1007/s00373-024-02808-2","DOIUrl":"https://doi.org/10.1007/s00373-024-02808-2","url":null,"abstract":"<p>We consider the problem of listing all spanning trees of a graph <i>G</i> such that successive trees differ by pivoting a single edge around a vertex. Such a listing is called a “pivot Gray code”, and it has more stringent conditions than known “revolving-door” Gray codes for spanning trees. Most revolving-door algorithms employ a standard edge-deletion/edge-contraction recursive approach which we demonstrate presents natural challenges when requiring the “pivot” property. Our main result is the discovery of a greedy strategy to list the spanning trees of the fan graph in a pivot Gray code order. It is the first greedy algorithm for exhaustively generating spanning trees using such a minimal change operation. The resulting listing is then studied to find a recursive algorithm that produces the same listing in <i>O</i>(1)-amortized time using <i>O</i>(<i>n</i>) space. Additionally, we present <i>O</i>(<i>n</i>)-time algorithms for ranking and unranking the spanning trees for our listing. Finally, we discuss how our listing can be applied to find a pivot Gray code for the wheel graph.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141505151","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
Injective Chromatic Index of $$K_4$$ -Minor Free Graphs $$K_4$$ 小自由图的注入色度指数
IF 0.7 4区 数学 Q3 Mathematics Pub Date : 2024-06-04 DOI: 10.1007/s00373-024-02807-3
Jian-Bo Lv, Jiacong Fu, Jianxi Li

An edge-coloring of a graph G is injective if for any two distinct edges (e_1) and (e_2), the colors of (e_1) and (e_2) are distinct if they are at distance 2 in G or in a common triangle. The injective chromatic index of G, (chi ^prime _{inj}(G)), is the minimum number of colors needed for an injective edge-coloring of G. In this note, we show that every (K_4)-minor free graph G with maximum degree (Delta (G)ge 3) satisfies (chi ^prime _{inj}(G)le 2Delta (G)+1).

如果对于任意两条不同的边(e_1)和(e_2)来说,如果它们在 G 中的距离是 2 或者在一个共同的三角形中,那么它们的颜色就是不同的,那么图 G 的边着色就是可注入的。G 的注入色度指数((chi ^prime _{inj}(G)))是 G 的注入边着色所需的最少颜色数。在本说明中,我们证明了每个具有最大度的(Delta (G)ge 3) 的(K_4)-minor free graph G 都满足(chi ^prime _{inj}(G)le 2Delta (G)+1)。
{"title":"Injective Chromatic Index of $$K_4$$ -Minor Free Graphs","authors":"Jian-Bo Lv, Jiacong Fu, Jianxi Li","doi":"10.1007/s00373-024-02807-3","DOIUrl":"https://doi.org/10.1007/s00373-024-02807-3","url":null,"abstract":"<p>An edge-coloring of a graph <i>G</i> is <i>injective</i> if for any two distinct edges <span>(e_1)</span> and <span>(e_2)</span>, the colors of <span>(e_1)</span> and <span>(e_2)</span> are distinct if they are at distance 2 in <i>G</i> or in a common triangle. The injective chromatic index of <i>G</i>, <span>(chi ^prime _{inj}(G))</span>, is the minimum number of colors needed for an injective edge-coloring of <i>G</i>. In this note, we show that every <span>(K_4)</span>-minor free graph <i>G</i> with maximum degree <span>(Delta (G)ge 3)</span> satisfies <span>(chi ^prime _{inj}(G)le 2Delta (G)+1)</span>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141255081","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
A Dirac-Type Theorem for Uniform Hypergraphs 均匀超图的狄拉克定理
IF 0.7 4区 数学 Q3 Mathematics Pub Date : 2024-06-01 DOI: 10.1007/s00373-024-02802-8
Yue Ma, Xinmin Hou, Jun Gao

Dirac (Proc Lond Math Soc (3) 2:69–81, 1952) proved that every connected graph of order (n>2k+1) with minimum degree more than k contains a path of length at least (2k+1). In this article, we give a hypergraph extension of Dirac’s theorem: Given positive integers nk and r, let H be a connected n-vertex r-graph with no Berge path of length (2k+1). (1) If (k> rge 4) and (n>2k+1), then (delta _1(H)le left( {begin{array}{c}k r-1end{array}}right) ). Furthermore, there exist hypergraphs (S'_r(n,k), S_r(n,k)) and (S(sK_{k+1}^{(r)},1)) such that the equality holds if and only if (S'_r(n,k)subseteq Hsubseteq S_r(n,k)) or (Hcong S(sK_{k+1}^{(r)},1)); (2) If (kge rge 2) and (n>2k(r-1)), then (delta _1(H)le left( {begin{array}{c}k r-1end{array}}right) ). As an application of (1), we give a better lower bound of the minimum degree than the ones in the Dirac-type results for Berge Hamiltonian cycle given by Bermond et al. (Hypergraphes Hamiltoniens. In: Problémes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). Colloq. Internat. CNRS, vol. 260, pp. 39–43. CNRS, Paris, 1976) or Clemens et al. (Electron Notes Discrete Math 54:181–186, 2016), respectively.

狄拉克(Proc Lond Math Soc (3) 2:69-81,1952)证明了最小度大于 k 的每个阶为 (n>2k+1)的连通图都包含一条长度至少为 (2k+1)的路径。本文给出了狄拉克定理的超图扩展:给定正整数 n、k 和 r,设 H 是一个连通的 n 顶点 r 图,其中没有长度为 (2k+1)的 Berge 路径。(1) 如果(k> rge 4) 并且(n>2k+1),那么(delta _1(H)le left( {begin{array}{c}kr-1end{array}right) )。此外,存在超图 (S'_r(n,k), S_r(n,k)) 和 (S(sK_{k+1}^{(r)}、1)),使得当且仅当(S'_r(n,k)subseteq Hsubseteq S_r(n,k))或者(Hcong S(sK_{k+1}^{(r)},1)) 时,相等关系成立;(2) 如果 (kge rge 2) and (n>2k(r-1)), then (delta _1(H)le left( {begin{array}{c}k r-1end{array}}right)).作为(1)的应用,我们给出了一个比 Bermond 等人给出的 Berge Hamiltonian 循环的 Dirac 型结果(Hypergraphes Hamiltoniens.In:Problémes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976).Colloq.Internat.CNRS, vol. 260, pp.CNRS, Paris, 1976)或克莱门斯等人(Electron Notes Discrete Math 54:181-186, 2016)分别。
{"title":"A Dirac-Type Theorem for Uniform Hypergraphs","authors":"Yue Ma, Xinmin Hou, Jun Gao","doi":"10.1007/s00373-024-02802-8","DOIUrl":"https://doi.org/10.1007/s00373-024-02802-8","url":null,"abstract":"<p>Dirac (Proc Lond Math Soc (3) 2:69–81, 1952) proved that every connected graph of order <span>(n&gt;2k+1)</span> with minimum degree more than <i>k</i> contains a path of length at least <span>(2k+1)</span>. In this article, we give a hypergraph extension of Dirac’s theorem: Given positive integers <i>n</i>, <i>k</i> and <i>r</i>, let <i>H</i> be a connected <i>n</i>-vertex <i>r</i>-graph with no Berge path of length <span>(2k+1)</span>. (1) If <span>(k&gt; rge 4)</span> and <span>(n&gt;2k+1)</span>, then <span>(delta _1(H)le left( {begin{array}{c}k r-1end{array}}right) )</span>. Furthermore, there exist hypergraphs <span>(S'_r(n,k), S_r(n,k))</span> and <span>(S(sK_{k+1}^{(r)},1))</span> such that the equality holds if and only if <span>(S'_r(n,k)subseteq Hsubseteq S_r(n,k))</span> or <span>(Hcong S(sK_{k+1}^{(r)},1))</span>; (2) If <span>(kge rge 2)</span> and <span>(n&gt;2k(r-1))</span>, then <span>(delta _1(H)le left( {begin{array}{c}k r-1end{array}}right) )</span>. As an application of (1), we give a better lower bound of the minimum degree than the ones in the Dirac-type results for Berge Hamiltonian cycle given by Bermond et al. (Hypergraphes Hamiltoniens. In: Problémes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). Colloq. Internat. CNRS, vol. 260, pp. 39–43. CNRS, Paris, 1976) or Clemens et al. (Electron Notes Discrete Math 54:181–186, 2016), respectively.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141194204","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
Irreducible Pairings and Indecomposable Tournaments 不可还原配对和不可分解锦标赛
IF 0.7 4区 数学 Q3 Mathematics Pub Date : 2024-05-30 DOI: 10.1007/s00373-024-02803-7
Houmem Belkhechine, Cherifa Ben Salha, Rim Romdhane

We only consider finite structures. With every totally ordered set V and a subset P of (left( {begin{array}{c}V 2end{array}}right) ), we associate the underlying tournament (textrm{Inv}({underline{V}}, P)) obtained from the transitive tournament ({underline{V}}:=(V, {(x,y) in V times V: x < y })) by reversing P, i.e., by reversing the arcs (xy) such that ({x,y} in P). The subset P is a pairing (of (cup P)) if (|cup P| = 2|P|), a quasi-pairing (of (cup P)) if (|cup P| = 2|P|-1); it is irreducible if no nontrivial interval of (cup P) is a union of connected components of the graph ((cup P, P)). In this paper, we consider pairings and quasi-pairings in relation to tournaments. We establish close relationships between irreducibility of pairings (or quasi-pairings) and indecomposability of their underlying tournaments under modular decomposition. For example, given a pairing P of a totally ordered set V of size at least 6, the pairing P is irreducible if and only if the tournament (textrm{Inv}({underline{V}}, P)) is indecomposable. This is a consequence of a more general result characterizing indecomposable tournaments obtained from transitive tournaments by reversing pairings. We obtain analogous results in the case of quasi-pairings.

我们只考虑有限结构。对于每一个完全有序集合 V 和一个子集 P,我们通过反转 P, i 来关联从传递锦标赛({underline{V}}:=(V, {(x,y) in V times V: x < y }))通过反转 P 得到,即e.,通过反转弧(x, y),使得({x, y}in P )。如果 (|cup P| = 2|P|) 子集 P 是((cup P) 的)配对,如果 (|cup P| = 2|P|-1) 子集 P 是((cup P) 的)准配对;如果(cup P) 的无非数区间是图((cup P, P))的连接成分的联合,那么它就是不可还原的。在本文中,我们考虑配对和准配对与锦标赛的关系。我们建立了配对(或准配对)的不可还原性与其底层锦标赛在模块分解下的不可分解性之间的密切关系。例如,给定大小至少为 6 的完全有序集合 V 的配对 P,当且仅当锦标赛 (textrm{Inv}({underline{V}}, P))是不可分解的,配对 P 才是不可还原的。这是一个更一般的结果的结果,它描述了通过反转配对从反式锦标赛得到的不可分解锦标赛的特征。我们在准配对的情况下也得到了类似的结果。
{"title":"Irreducible Pairings and Indecomposable Tournaments","authors":"Houmem Belkhechine, Cherifa Ben Salha, Rim Romdhane","doi":"10.1007/s00373-024-02803-7","DOIUrl":"https://doi.org/10.1007/s00373-024-02803-7","url":null,"abstract":"<p>We only consider finite structures. With every totally ordered set <i>V</i> and a subset <i>P</i> of <span>(left( {begin{array}{c}V 2end{array}}right) )</span>, we associate the underlying tournament <span>(textrm{Inv}({underline{V}}, P))</span> obtained from the transitive tournament <span>({underline{V}}:=(V, {(x,y) in V times V: x &lt; y }))</span> by reversing <i>P</i>, i.e., by reversing the arcs (<i>x</i>, <i>y</i>) such that <span>({x,y} in P)</span>. The subset <i>P</i> is a pairing (of <span>(cup P)</span>) if <span>(|cup P| = 2|P|)</span>, a quasi-pairing (of <span>(cup P)</span>) if <span>(|cup P| = 2|P|-1)</span>; it is irreducible if no nontrivial interval of <span>(cup P)</span> is a union of connected components of the graph <span>((cup P, P))</span>. In this paper, we consider pairings and quasi-pairings in relation to tournaments. We establish close relationships between irreducibility of pairings (or quasi-pairings) and indecomposability of their underlying tournaments under modular decomposition. For example, given a pairing <i>P</i> of a totally ordered set <i>V</i> of size at least 6, the pairing <i>P</i> is irreducible if and only if the tournament <span>(textrm{Inv}({underline{V}}, P))</span> is indecomposable. This is a consequence of a more general result characterizing indecomposable tournaments obtained from transitive tournaments by reversing pairings. We obtain analogous results in the case of quasi-pairings.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141194203","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 Cordiality Game and the Game Cordiality Number 亲切游戏和游戏亲切号码
IF 0.7 4区 数学 Q3 Mathematics Pub Date : 2024-05-30 DOI: 10.1007/s00373-024-02798-1
Elliot Krop, Aryan Mittal, Michael C. Wigal

The cordiality game is played on a graph G by two players, Admirable (A) and Impish (I), who take turns selecting unlabeled vertices of G. Admirable labels the selected vertices by 0 and Impish by 1, and the resulting label on any edge is the sum modulo 2 of the labels of the vertices incident to that edge. The two players have opposite goals: Admirable attempts to minimize the number of edges with different labels as much as possible while Impish attempts to maximize this number. When both Admirable and Impish play their optimal games, we define the game cordiality number, (c_g(G)), as the absolute difference between the number of edges labeled zero and one. Let (P_n) be the path on n vertices. We show (c_g(P_n)le frac{n-3}{3}) when (n equiv 0 pmod 3), (c_g(P_n)le frac{n-1}{3}) when (n equiv 1 pmod 3), and (c_g(P_n)le frac{n+1}{3}) when (n equiv 2pmod 3). Furthermore, we show a similar bound, (c_g(T) le frac{|T|}{2}) holds for any tree T.

亲切度游戏是由两个玩家--"可取的人"(A)和 "不可取的人"(I)--在图 G 上轮流选择图 G 中没有标签的顶点来玩。"可取的人 "会给选择的顶点贴 0 标签,"不可取的人 "会给选择的顶点贴 1 标签,任何一条边上的标签都是这条边上的顶点标签的模乘 2 之和。两位棋手的目标截然相反:Admirable 试图尽可能减少具有不同标签的边的数量,而 Impish 则试图最大化这一数量。当 Admirable 和 Impish 都进行他们的最优博弈时,我们将博弈亲和数 (c_g(G))定义为标签为 0 和 1 的边的绝对数量差。让 (P_n) 是 n 个顶点上的路径。我们证明了当(n)为0时,(c_g(P_n)le frac{n-3}{3}); 当(n)为1时,(c_g(P_n)le frac{n-1}{3}); 当(n)为2时,(c_g(P_n)le frac{n+1}{3})。此外,我们还证明了一个类似的约束,即对于任何树 T,c_g(T) 都成立。
{"title":"The Cordiality Game and the Game Cordiality Number","authors":"Elliot Krop, Aryan Mittal, Michael C. Wigal","doi":"10.1007/s00373-024-02798-1","DOIUrl":"https://doi.org/10.1007/s00373-024-02798-1","url":null,"abstract":"<p>The <i>cordiality game</i> is played on a graph <i>G</i> by two players, Admirable (A) and Impish (I), who take turns selecting unlabeled vertices of <i>G</i>. Admirable labels the selected vertices by 0 and Impish by 1, and the resulting label on any edge is the sum modulo 2 of the labels of the vertices incident to that edge. The two players have opposite goals: Admirable attempts to minimize the number of edges with different labels as much as possible while Impish attempts to maximize this number. When both Admirable and Impish play their optimal games, we define the <i>game cordiality number</i>, <span>(c_g(G))</span>, as the absolute difference between the number of edges labeled zero and one. Let <span>(P_n)</span> be the path on <i>n</i> vertices. We show <span>(c_g(P_n)le frac{n-3}{3})</span> when <span>(n equiv 0 pmod 3)</span>, <span>(c_g(P_n)le frac{n-1}{3})</span> when <span>(n equiv 1 pmod 3)</span>, and <span>(c_g(P_n)le frac{n+1}{3})</span> when <span>(n equiv 2pmod 3)</span>. Furthermore, we show a similar bound, <span>(c_g(T) le frac{|T|}{2})</span> holds for any tree <i>T</i>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141194201","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
A Characterization of Graphs with Semitotal Domination Number One-Third Their Order 具有三分之一阶半总支配数的图的特征
IF 0.7 4区 数学 Q3 Mathematics Pub Date : 2024-05-30 DOI: 10.1007/s00373-024-02800-w
Jie Chen, Cai-Xia Wang, Yi-Ping Liang, Shou-Jun Xu

In an isolate-free graph G, a subset S of vertices is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of S. The semitotal domination number of G, denoted by (gamma _{t2}(G)), is the minimum cardinality of a semitotal dominating set in G. Zhu et al. (Gr Combin 33, 1119–1130, 2017) proved that if (Gnotin {K_4,N_2}) is a connected claw-free cubic graph of order n, then (gamma _{t2}(G)le frac{n}{3}), which is sharp. They proposed the problem of characterizing the extremal graphs. We completely solve this problem. There are ten classes of graphs, three of which are infinite families of graphs.

在无孤立图 G 中,如果顶点子集 S 是 G 的支配集,且 S 中的每个顶点与 S 中另一个顶点的距离都在 2 以内,则该顶点子集 S 是 G 的半总支配集。G 的半总支配数用 (gamma _{t2}(G)) 表示,它是 G 中半总支配集的最小卡片度。Zhu 等人(Gr Combin 33, 1119-1130, 2017)证明了如果 (Gnotin {K_4,N_2}) 是阶数为 n 的连通无爪立方图,那么 (gamma _{t2}(G)le frac{n}{3}) 是尖锐的。他们提出了极值图的特征问题。我们完全解决了这个问题。有十类图,其中三类是无限图族。
{"title":"A Characterization of Graphs with Semitotal Domination Number One-Third Their Order","authors":"Jie Chen, Cai-Xia Wang, Yi-Ping Liang, Shou-Jun Xu","doi":"10.1007/s00373-024-02800-w","DOIUrl":"https://doi.org/10.1007/s00373-024-02800-w","url":null,"abstract":"<p>In an isolate-free graph <i>G</i>, a subset <i>S</i> of vertices is a <i>semitotal dominating set</i> of <i>G</i> if it is a dominating set of <i>G</i> and every vertex in <i>S</i> is within distance 2 of another vertex of <i>S</i>. The <i>semitotal domination number</i> of <i>G</i>, denoted by <span>(gamma _{t2}(G))</span>, is the minimum cardinality of a semitotal dominating set in <i>G</i>. Zhu et al. (Gr Combin 33, 1119–1130, 2017) proved that if <span>(Gnotin {K_4,N_2})</span> is a connected claw-free cubic graph of order <i>n</i>, then <span>(gamma _{t2}(G)le frac{n}{3})</span>, which is sharp. They proposed the problem of characterizing the extremal graphs. We completely solve this problem. There are ten classes of graphs, three of which are infinite families of graphs.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141194205","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
Recognizing $$mathbf {W_2}$$ Graphs 识别 $$mathbf {W_2}$ 图形
IF 0.7 4区 数学 Q3 Mathematics Pub Date : 2024-05-23 DOI: 10.1007/s00373-024-02777-6
Vadim E. Levit, David Tankus
{"title":"Recognizing $$mathbf {W_2}$$ Graphs","authors":"Vadim E. Levit, David Tankus","doi":"10.1007/s00373-024-02777-6","DOIUrl":"https://doi.org/10.1007/s00373-024-02777-6","url":null,"abstract":"","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141107697","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
Transitive Subtournaments of k-th Power Paley Digraphs and Improved Lower Bounds for Ramsey Numbers k-th Power Paley Digraph 的跨域子域和改进的拉姆齐数下限
IF 0.7 4区 数学 Q3 Mathematics Pub Date : 2024-05-21 DOI: 10.1007/s00373-024-02792-7
Dermot McCarthy, Mason Springfield

Let (k ge 2) be an even integer. Let q be a prime power such that (q equiv k+1 (text {mod},,2k)). We define the k-th power Paley digraph of order q, (G_k(q)), as the graph with vertex set (mathbb {F}_q) where (a rightarrow b) is an edge if and only if (b-a) is a k-th power residue. This generalizes the ((k=2)) Paley Tournament. We provide a formula, in terms of finite field hypergeometric functions, for the number of transitive subtournaments of order four contained in (G_k(q)), (mathcal {K}_4(G_k(q))), which holds for all k. We also provide a formula, in terms of Jacobi sums, for the number of transitive subtournaments of order three contained in (G_k(q)), (mathcal {K}_3(G_k(q))). In both cases, we give explicit determinations of these formulae for small k. We show that zero values of (mathcal {K}_4(G_k(q))) (resp. (mathcal {K}_3(G_k(q)))) yield lower bounds for the multicolor directed Ramsey numbers (R_{frac{k}{2}}(4)=R(4,4,ldots ,4)) (resp. (R_{frac{k}{2}}(3))). We state explicitly these lower bounds for (kle 10) and compare to known bounds, showing improvement for (R_2(4)) and (R_3(3)). Combining with known multiplicative relations we give improved lower bounds for (R_{t}(4)), for all (tge 2), and for (R_{t}(3)), for all (t ge 3).

让 (k ge 2) 是一个偶整数。让 q 是一个质数幂,使得 (q equiv k+1 (text {mod},,2k)).我们定义阶数为q的k次幂帕利数字图(G_k(q))为具有顶点集(mathbb {F}_q) 的图,其中(a rightarrow b) 是一条边,当且仅当(b-a) 是一个k次幂残差。这概括了 ((k=2))帕利锦标赛。我们用有限域超几何函数为包含在 (G_k(q)), (mathcal {K}_4(G_k(q))) 中的四阶反式子锦标赛的数目提供了一个公式,这个公式对所有 k 都成立。我们还提供了一个雅可比和公式,用于计算 (G_k(q)), (mathcal {K}_3(G_k(q))) 中包含的三阶反式子域的数量。我们证明了 (mathcal {K}_4(G_k(q))) 的零值(respect.(mathcal{K}_3(G_k(q)))产生了多色有向拉姆齐数的下界(R_{frac{k}{2}}(4)=R(4,4,ldots ,4))(resp. (R_{frac{k}{2}}(3))。我们明确地指出了这些下限,并与(R_2(4))和(R_3(3))的已知下限进行了比较。结合已知的乘法关系,我们给出了对于所有(tge 2) 和所有(tge 3) 的(R_{t}(4))和(R_{t}(3))的改进下界。
{"title":"Transitive Subtournaments of k-th Power Paley Digraphs and Improved Lower Bounds for Ramsey Numbers","authors":"Dermot McCarthy, Mason Springfield","doi":"10.1007/s00373-024-02792-7","DOIUrl":"https://doi.org/10.1007/s00373-024-02792-7","url":null,"abstract":"<p>Let <span>(k ge 2)</span> be an even integer. Let <i>q</i> be a prime power such that <span>(q equiv k+1 (text {mod},,2k))</span>. We define the <i>k-th power Paley digraph</i> of order <i>q</i>, <span>(G_k(q))</span>, as the graph with vertex set <span>(mathbb {F}_q)</span> where <span>(a rightarrow b)</span> is an edge if and only if <span>(b-a)</span> is a <i>k</i>-th power residue. This generalizes the (<span>(k=2)</span>) Paley Tournament. We provide a formula, in terms of finite field hypergeometric functions, for the number of transitive subtournaments of order four contained in <span>(G_k(q))</span>, <span>(mathcal {K}_4(G_k(q)))</span>, which holds for all <i>k</i>. We also provide a formula, in terms of Jacobi sums, for the number of transitive subtournaments of order three contained in <span>(G_k(q))</span>, <span>(mathcal {K}_3(G_k(q)))</span>. In both cases, we give explicit determinations of these formulae for small <i>k</i>. We show that zero values of <span>(mathcal {K}_4(G_k(q)))</span> (resp. <span>(mathcal {K}_3(G_k(q)))</span>) yield lower bounds for the multicolor directed Ramsey numbers <span>(R_{frac{k}{2}}(4)=R(4,4,ldots ,4))</span> (resp. <span>(R_{frac{k}{2}}(3))</span>). We state explicitly these lower bounds for <span>(kle 10)</span> and compare to known bounds, showing improvement for <span>(R_2(4))</span> and <span>(R_3(3))</span>. Combining with known multiplicative relations we give improved lower bounds for <span>(R_{t}(4))</span>, for all <span>(tge 2)</span>, and for <span>(R_{t}(3))</span>, for all <span>(t ge 3)</span>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141150800","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
期刊
Graphs and Combinatorics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1