Pub Date : 2026-05-15Epub Date: 2026-01-14DOI: 10.1016/j.dam.2025.12.068
Bernard De Baets , Emilio De Santis
A set of candidates is presented to a commission. At every round, each member of this commission votes by pairwise comparison, and one-half of the candidates is deleted from the tournament, the remaining ones proceeding to the next round until the th round (the final one) in which the final winner is declared. The candidates are arranged on a board in a given order, which is maintained among the remaining candidates at all rounds. A study of the size of the commission is carried out in order to obtain the desired result of any candidate being a possible winner. For candidates with , we identify a voting profile with voters such that any candidate could win simply by choosing a proper initial order of the candidates. Moreover, in the setting of a random number of voters, we obtain the same results, with high probability, when the expected number of voters is large.
{"title":"Voting profiles admitting all candidates as knockout winners","authors":"Bernard De Baets , Emilio De Santis","doi":"10.1016/j.dam.2025.12.068","DOIUrl":"10.1016/j.dam.2025.12.068","url":null,"abstract":"<div><div>A set of <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></math></span> candidates is presented to a commission. At every round, each member of this commission votes by pairwise comparison, and one-half of the candidates is deleted from the tournament, the remaining ones proceeding to the next round until the <span><math><mi>n</mi></math></span>th round (the final one) in which the final winner is declared. The candidates are arranged on a board in a given order, which is maintained among the remaining candidates at all rounds. A study of the size of the commission is carried out in order to obtain the desired result of any candidate being a possible winner. For <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></math></span> candidates with <span><math><mrow><mi>n</mi><mo>≥</mo><mn>3</mn></mrow></math></span>, we identify a voting profile with <span><math><mrow><mn>4</mn><mi>n</mi><mo>−</mo><mn>3</mn></mrow></math></span> voters such that any candidate could win simply by choosing a proper initial order of the candidates. Moreover, in the setting of a random number of voters, we obtain the same results, with high probability, when the expected number of voters is large.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 340-351"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145980019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-12DOI: 10.1016/j.dam.2025.12.047
G. Araujo-Pardo , C. De la Cruz , M. Matamala , M.A. Pizaña
Cages (-regular graphs of girth and minimum order) and their variants have been studied for over seventy years. Here we propose a new variant, weighted cages. We characterize their existence; for cases we determine their order; we give Moore-like bounds and present some computational results.
{"title":"Weighted cages","authors":"G. Araujo-Pardo , C. De la Cruz , M. Matamala , M.A. Pizaña","doi":"10.1016/j.dam.2025.12.047","DOIUrl":"10.1016/j.dam.2025.12.047","url":null,"abstract":"<div><div>Cages (<span><math><mi>r</mi></math></span>-regular graphs of girth <span><math><mi>g</mi></math></span> and minimum order) and their variants have been studied for over seventy years. Here we propose a new variant, <em>weighted cages</em>. We characterize their existence; for cases <span><math><mrow><mi>g</mi><mo>=</mo><mn>3</mn><mo>,</mo><mn>4</mn></mrow></math></span> we determine their order; we give Moore-like bounds and present some computational results.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 293-308"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145980243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-02-14DOI: 10.1016/j.dam.2026.02.005
Pasquale Carotenuto , Sara Nicoloso , Alessio Salvatore
A circulant graph is a graph with vertices such that each vertex is adjacent to vertices and . In this paper, we investigate the Maximum Independent Set problem on 4-regular connected circulant graphs , with arbitrary , , and . We approach the problem in an algebraic and combinatorial way based on an array representation of the graph. We prove that the cardinality of a maximum independent set is equal to where is the cardinality of a minimum subset of vertices that has a nonempty intersection with every odd cycle. The approach we propose shows that the Maximum Independent Set problem on any can be solved in time. As a consequence, covering number, odd cycle transversal, and fractional chromatic number are all linear time solvable on these graphs.
{"title":"The Maximum Independent Set problem on circulant graphs Cn(a,b)","authors":"Pasquale Carotenuto , Sara Nicoloso , Alessio Salvatore","doi":"10.1016/j.dam.2026.02.005","DOIUrl":"10.1016/j.dam.2026.02.005","url":null,"abstract":"<div><div>A circulant graph <span><math><mrow><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub><mrow><mo>(</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>)</mo></mrow></mrow></math></span> is a graph with <span><math><mi>n</mi></math></span> vertices <span><math><mrow><mo>{</mo><msub><mrow><mi>v</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msub><mo>}</mo></mrow></math></span> such that each vertex <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is adjacent to vertices <span><math><msub><mrow><mi>v</mi></mrow><mrow><mrow><mo>(</mo><mi>i</mi><mo>+</mo><mi>a</mi><mo>)</mo></mrow><mspace></mspace><mo>mod</mo><mspace></mspace><mi>n</mi></mrow></msub></math></span> and <span><math><msub><mrow><mi>v</mi></mrow><mrow><mrow><mo>(</mo><mi>i</mi><mo>+</mo><mi>b</mi><mo>)</mo></mrow><mspace></mspace><mo>mod</mo><mspace></mspace><mi>n</mi></mrow></msub></math></span>. In this paper, we investigate the Maximum Independent Set problem on 4-regular connected circulant graphs <span><math><mrow><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub><mrow><mo>(</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>)</mo></mrow></mrow></math></span>, with arbitrary <span><math><mi>n</mi></math></span>, <span><math><mi>a</mi></math></span>, and <span><math><mi>b</mi></math></span>. We approach the problem in an algebraic and combinatorial way based on an array representation of the graph. We prove that the cardinality of a maximum independent set is equal to <span><math><mfrac><mrow><mi>n</mi><mo>−</mo><mrow><mo>|</mo><msup><mrow><mi>W</mi></mrow><mrow><mo>∗</mo></mrow></msup><mo>|</mo></mrow></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> where <span><math><mrow><mo>|</mo><msup><mrow><mi>W</mi></mrow><mrow><mo>∗</mo></mrow></msup><mo>|</mo></mrow></math></span> is the cardinality of a minimum subset of vertices that has a nonempty intersection with every odd cycle. The approach we propose shows that the Maximum Independent Set problem on any <span><math><mrow><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub><mrow><mo>(</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>)</mo></mrow></mrow></math></span> can be solved in <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> time. As a consequence, covering number, odd cycle transversal, and fractional chromatic number are all linear time solvable on these graphs.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 411-423"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146173291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-22DOI: 10.1016/j.dam.2026.01.018
Weixing Zheng , Shuming Zhou , Lulu Yang
<div><div>The rapid expansion of multiprocessor systems in modern computing platforms has posed new challenges to ensure system reliability and fault resilience under complex and large-scale failure scenarios. Classical connectivity and diagnosability are two key parameters to evaluate the reliability and self-diagnostic capability of multiprocessor systems. As generalizations of traditional connectivity and diagnosability, <span><math><mi>g</mi></math></span>-extra connectivity and <span><math><mi>r</mi></math></span>-component connectivity, together with their corresponding diagnosabilities, offer a more refined characterization of fault tolerability. In this paper, we determine the fault tolerability of Cayley graphs <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> generated by transposition unicyclic graphs with a triangle. We show that the <span><math><mi>g</mi></math></span>-extra connectivity of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> is <span><math><mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mi>n</mi><mo>−</mo><mfrac><mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>2</mn><mo>)</mo></mrow></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math></span> for <span><math><mrow><mn>2</mn><mo>≤</mo><mi>g</mi><mo>≤</mo><mo>|</mo><mi>M</mi><mo>|</mo><mo>+</mo><mn>2</mn></mrow></math></span>, where <span><math><mi>M</mi></math></span> is the maximum matching of the generating graph of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> with the removal of a 3-cycle. Furthermore, we show that the <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> under both PMC and MM* models is uniformly <span><math><mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mi>n</mi><mo>−</mo><mfrac><mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>2</mn><mo>)</mo></mrow></mrow><mrow><mn>2</mn></mrow></mfrac><mo>+</mo><mi>g</mi></mrow></math></span>. In addition, we prove that the <span><math><mrow><mo>(</mo><mi>r</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow></math></span>-component connectivity of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> is <span><math><mrow><mi>r</mi><mi>n</mi><mo>−</mo><mfrac><mrow><mi>r</mi><mrow><mo>(</mo><mi>r</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math></span>, and <span><math><mrow><mo>(</mo><mi>r</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow></math></span>-component diagnosability of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></
{"title":"Fault tolerability of Cayley graphs generated by transposition unicyclic graphs with a triangle","authors":"Weixing Zheng , Shuming Zhou , Lulu Yang","doi":"10.1016/j.dam.2026.01.018","DOIUrl":"10.1016/j.dam.2026.01.018","url":null,"abstract":"<div><div>The rapid expansion of multiprocessor systems in modern computing platforms has posed new challenges to ensure system reliability and fault resilience under complex and large-scale failure scenarios. Classical connectivity and diagnosability are two key parameters to evaluate the reliability and self-diagnostic capability of multiprocessor systems. As generalizations of traditional connectivity and diagnosability, <span><math><mi>g</mi></math></span>-extra connectivity and <span><math><mi>r</mi></math></span>-component connectivity, together with their corresponding diagnosabilities, offer a more refined characterization of fault tolerability. In this paper, we determine the fault tolerability of Cayley graphs <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> generated by transposition unicyclic graphs with a triangle. We show that the <span><math><mi>g</mi></math></span>-extra connectivity of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> is <span><math><mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mi>n</mi><mo>−</mo><mfrac><mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>2</mn><mo>)</mo></mrow></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math></span> for <span><math><mrow><mn>2</mn><mo>≤</mo><mi>g</mi><mo>≤</mo><mo>|</mo><mi>M</mi><mo>|</mo><mo>+</mo><mn>2</mn></mrow></math></span>, where <span><math><mi>M</mi></math></span> is the maximum matching of the generating graph of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> with the removal of a 3-cycle. Furthermore, we show that the <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> under both PMC and MM* models is uniformly <span><math><mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mi>n</mi><mo>−</mo><mfrac><mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mi>g</mi><mo>+</mo><mn>2</mn><mo>)</mo></mrow></mrow><mrow><mn>2</mn></mrow></mfrac><mo>+</mo><mi>g</mi></mrow></math></span>. In addition, we prove that the <span><math><mrow><mo>(</mo><mi>r</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow></math></span>-component connectivity of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> is <span><math><mrow><mi>r</mi><mi>n</mi><mo>−</mo><mfrac><mrow><mi>r</mi><mrow><mo>(</mo><mi>r</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math></span>, and <span><math><mrow><mo>(</mo><mi>r</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow></math></span>-component diagnosability of <span><math><mrow><mi>U</mi><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 372-385"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146023532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-19DOI: 10.1016/j.dam.2026.01.004
Chuanye Zheng, Liqiong Xu
<div><div>As multiprocessor systems scale up in size and complexity to meet increasing computational demands, link or processor failures are inevitable. Thus reliability of multiprocessor systems needs to be considered. Restricting the surviving components within multiprocessor systems can enhance the evaluation of their reliability. Recently, Yang et al. introduced a new parameter called <span><math><mi>h</mi></math></span>-extra <span><math><mi>r</mi></math></span>-component edge-connectivity, which requires that for a connected graph <span><math><mi>G</mi></math></span> and an edge-cut <span><math><mi>F</mi></math></span> of <span><math><mi>G</mi></math></span>, there exist at least <span><math><mi>r</mi></math></span> components surviving in <span><math><mrow><mi>G</mi><mo>−</mo><mi>F</mi></mrow></math></span> and the order of each component is not less than <span><math><mi>h</mi></math></span>. In this paper, we consider the <span><math><mi>h</mi></math></span>-extra <span><math><mi>r</mi></math></span>-component edge-connectivity of the 3-ary <span><math><mi>n</mi></math></span>-cube <span><math><msubsup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msubsup></math></span> and determine that <span><math><mrow><mi>c</mi><msubsup><mrow><mi>λ</mi></mrow><mrow><mn>4</mn></mrow><mrow><mi>h</mi></mrow></msubsup><mrow><mo>(</mo><msubsup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msubsup><mo>)</mo></mrow><mo>=</mo><mn>6</mn><mi>n</mi><mi>h</mi><mo>−</mo><mn>3</mn><mi>e</mi><msub><mrow><mi>x</mi></mrow><mrow><mi>h</mi></mrow></msub><mrow><mo>(</mo><msubsup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msubsup><mo>)</mo></mrow><mo>−</mo><mn>3</mn><mi>h</mi></mrow></math></span> for <span><math><mrow><mi>n</mi><mo>≥</mo><mn>5</mn></mrow></math></span> and <span><math><mrow><mn>1</mn><mo>≤</mo><mi>h</mi><mo>≤</mo><mi>δ</mi><mi>⋅</mi><msup><mrow><mn>3</mn></mrow><mrow><mrow><mo>⌈</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌉</mo></mrow><mo>−</mo><mn>1</mn></mrow></msup><mo>−</mo><mn>1</mn></mrow></math></span> where <span><math><mrow><mi>δ</mi><mo>=</mo><mn>1</mn></mrow></math></span> if <span><math><mi>n</mi></math></span> is odd and <span><math><mrow><mi>δ</mi><mo>=</mo><mn>2</mn></mrow></math></span> if <span><math><mi>n</mi></math></span> is even, <span><math><mrow><mi>c</mi><msubsup><mrow><mi>λ</mi></mrow><mrow><mi>r</mi></mrow><mrow><msup><mrow><mn>3</mn></mrow><mrow><mi>k</mi></mrow></msup></mrow></msubsup><mrow><mo>(</mo><msubsup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msubsup><mo>)</mo></mrow><mo>=</mo><mrow><mo>(</mo><mi>r</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mn>2</mn><mi>n</mi><mo>−</mo><mn>2</mn><mi>k</mi><mo>)</mo></mrow><msup><mrow><mn>3</mn></mrow><mrow><mi>k</mi></mrow></msup><mo>−</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mi>e</mi><msub><mrow><mi>x</mi></mrow><m
随着多处理器系统的规模和复杂性不断扩大，以满足不断增长的计算需求，链路或处理器故障是不可避免的。因此，需要考虑多处理器系统的可靠性。限制多处理机系统中幸存部件的数量可以提高对系统可靠性的评估。最近,杨等人提出了一个新的参数称为h-extra r-component edge,这要求一个连通图G和edge-cut F (G,存在至少r G−F幸存的组件,每个组件的顺序不小于h。在本文中,我们考虑h-extra r-component edge的3-ary n立方体Qn3和确定cλ4 h (Qn3) = 6 nh−3 exh (Qn3)−3 h n≥5和1 h≤≤δ⋅3⌈n2⌉−−1δ= 1如果n是奇怪和δ= 2如果n是偶数,cλr3k (Qn3) = (r−1)(2 n−2 k) 3 k 12 exr−−1 (Qn3)⋅3 k 1≤(r−1)3 k≤δ⋅3⌈n2⌉−1和cλ43 k (Qn3) = (2 n−2 k−1)3 k + 1 0≤k≤n−2。
{"title":"Assessing reliability of 3-ary n-cubes based on the h-extra r-component edge-connectivity","authors":"Chuanye Zheng, Liqiong Xu","doi":"10.1016/j.dam.2026.01.004","DOIUrl":"10.1016/j.dam.2026.01.004","url":null,"abstract":"<div><div>As multiprocessor systems scale up in size and complexity to meet increasing computational demands, link or processor failures are inevitable. Thus reliability of multiprocessor systems needs to be considered. Restricting the surviving components within multiprocessor systems can enhance the evaluation of their reliability. Recently, Yang et al. introduced a new parameter called <span><math><mi>h</mi></math></span>-extra <span><math><mi>r</mi></math></span>-component edge-connectivity, which requires that for a connected graph <span><math><mi>G</mi></math></span> and an edge-cut <span><math><mi>F</mi></math></span> of <span><math><mi>G</mi></math></span>, there exist at least <span><math><mi>r</mi></math></span> components surviving in <span><math><mrow><mi>G</mi><mo>−</mo><mi>F</mi></mrow></math></span> and the order of each component is not less than <span><math><mi>h</mi></math></span>. In this paper, we consider the <span><math><mi>h</mi></math></span>-extra <span><math><mi>r</mi></math></span>-component edge-connectivity of the 3-ary <span><math><mi>n</mi></math></span>-cube <span><math><msubsup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msubsup></math></span> and determine that <span><math><mrow><mi>c</mi><msubsup><mrow><mi>λ</mi></mrow><mrow><mn>4</mn></mrow><mrow><mi>h</mi></mrow></msubsup><mrow><mo>(</mo><msubsup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msubsup><mo>)</mo></mrow><mo>=</mo><mn>6</mn><mi>n</mi><mi>h</mi><mo>−</mo><mn>3</mn><mi>e</mi><msub><mrow><mi>x</mi></mrow><mrow><mi>h</mi></mrow></msub><mrow><mo>(</mo><msubsup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msubsup><mo>)</mo></mrow><mo>−</mo><mn>3</mn><mi>h</mi></mrow></math></span> for <span><math><mrow><mi>n</mi><mo>≥</mo><mn>5</mn></mrow></math></span> and <span><math><mrow><mn>1</mn><mo>≤</mo><mi>h</mi><mo>≤</mo><mi>δ</mi><mi>⋅</mi><msup><mrow><mn>3</mn></mrow><mrow><mrow><mo>⌈</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌉</mo></mrow><mo>−</mo><mn>1</mn></mrow></msup><mo>−</mo><mn>1</mn></mrow></math></span> where <span><math><mrow><mi>δ</mi><mo>=</mo><mn>1</mn></mrow></math></span> if <span><math><mi>n</mi></math></span> is odd and <span><math><mrow><mi>δ</mi><mo>=</mo><mn>2</mn></mrow></math></span> if <span><math><mi>n</mi></math></span> is even, <span><math><mrow><mi>c</mi><msubsup><mrow><mi>λ</mi></mrow><mrow><mi>r</mi></mrow><mrow><msup><mrow><mn>3</mn></mrow><mrow><mi>k</mi></mrow></msup></mrow></msubsup><mrow><mo>(</mo><msubsup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msubsup><mo>)</mo></mrow><mo>=</mo><mrow><mo>(</mo><mi>r</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mn>2</mn><mi>n</mi><mo>−</mo><mn>2</mn><mi>k</mi><mo>)</mo></mrow><msup><mrow><mn>3</mn></mrow><mrow><mi>k</mi></mrow></msup><mo>−</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mi>e</mi><msub><mrow><mi>x</mi></mrow><m","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 361-371"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146024235","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-05DOI: 10.1016/j.dam.2025.12.044
Bilal Ahmad Rather , Hilal Ahmad Ganie , Jainfeng Wang
In a connected graph , the distance signless Laplacian is defined as , where is the diagonal matrix of vertex transmissions and is the distance matrix indexed by the vertices of , such that , where represents the distance between the vertices and . Motivated by the Laplacian and signless Laplacian matrices of , Aouchiche and Hensen (2013) developed the idea of distance (signless) Laplacian matrix, which has attracted the interest among numerous spectral graph theory researchers in the field of algebraic graph theory. The spectral investigation of resulted in numerous articles. In this paper, we present a review of research on the distance signless Laplacian of connected graphs.
{"title":"Distance signless Laplacian spectra of graphs: A survey","authors":"Bilal Ahmad Rather , Hilal Ahmad Ganie , Jainfeng Wang","doi":"10.1016/j.dam.2025.12.044","DOIUrl":"10.1016/j.dam.2025.12.044","url":null,"abstract":"<div><div>In a connected graph <span><math><mi>G</mi></math></span>, the distance signless Laplacian is defined as <span><math><mrow><msup><mrow><mi>D</mi></mrow><mrow><mi>Q</mi></mrow></msup><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><mi>D</mi><mi>i</mi><mi>a</mi><mi>g</mi><mrow><mo>(</mo><mi>T</mi><mi>r</mi><mo>)</mo></mrow><mo>+</mo><mi>D</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span>, where <span><math><mrow><mi>D</mi><mi>i</mi><mi>a</mi><mi>g</mi><mrow><mo>(</mo><mi>T</mi><mi>r</mi><mo>)</mo></mrow></mrow></math></span> is the diagonal matrix of vertex transmissions and <span><math><mrow><mi>D</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><msub><mrow><mrow><mo>(</mo><msub><mrow><mi>D</mi></mrow><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow></msub><mo>)</mo></mrow></mrow><mrow><mi>n</mi><mo>×</mo><mi>n</mi></mrow></msub></mrow></math></span> is the distance matrix indexed by the vertices of <span><math><mi>G</mi></math></span>, such that <span><math><mrow><msub><mrow><mi>D</mi></mrow><mrow><mi>i</mi><mo>,</mo><mi>j</mi></mrow></msub><mo>=</mo><mi>d</mi><mrow><mo>(</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>)</mo></mrow></mrow></math></span>, where <span><math><mrow><mi>d</mi><mrow><mo>(</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>)</mo></mrow></mrow></math></span> represents the distance between the vertices <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> and <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>j</mi></mrow></msub></math></span>. Motivated by the Laplacian and signless Laplacian matrices of <span><math><mi>G</mi></math></span>, Aouchiche and Hensen (2013) developed the idea of distance (signless) Laplacian matrix, which has attracted the interest among numerous spectral graph theory researchers in the field of algebraic graph theory. The spectral investigation of <span><math><mrow><msup><mrow><mi>D</mi></mrow><mrow><mi>Q</mi></mrow></msup><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> resulted in numerous articles. In this paper, we present a review of research on the distance signless Laplacian of connected graphs.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 41-138"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145898207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-05DOI: 10.1016/j.dam.2025.12.050
Gideon Amir , Yaakov Malinovsky
In this note, we extend a recent result on the uniqueness of the maximum score in a classical round-robin tournament to general round-robin tournament models with equally strong players, where the scores take values in .
{"title":"Uniqueness of maximum scores in countable-outcome round-robin tournaments","authors":"Gideon Amir , Yaakov Malinovsky","doi":"10.1016/j.dam.2025.12.050","DOIUrl":"10.1016/j.dam.2025.12.050","url":null,"abstract":"<div><div>In this note, we extend a recent result on the uniqueness of the maximum score in a classical round-robin tournament to general round-robin tournament models with equally strong players, where the scores take values in <span><math><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mspace></mspace><mn>1</mn><mo>]</mo></mrow></math></span>.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 16-22"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145898208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-16DOI: 10.1016/j.dam.2026.01.005
Shu-Li Zhao, Bao-Cheng Zhang
<div><div>Let <span><math><mi>G</mi></math></span> be a connected graph, <span><math><mrow><mi>S</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> and <span><math><mrow><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow><mo>≥</mo><mn>2</mn></mrow></math></span>, a tree <span><math><mi>T</mi></math></span> in <span><math><mi>G</mi></math></span> is called a pendant <span><math><mi>S</mi></math></span>-tree if <span><math><mrow><mi>S</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math></span> and the degree of each vertex in <span><math><mi>S</mi></math></span> is equal to one. Two pendant <span><math><mi>S</mi></math></span>-trees <span><math><msub><mrow><mi>T</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> and <span><math><msub><mrow><mi>T</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> are called internally disjoint if <span><math><mrow><mi>E</mi><mrow><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo></mrow><mo>∩</mo><mi>E</mi><mrow><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></mrow><mo>=</mo><mo>0̸</mo></mrow></math></span> and <span><math><mrow><mi>V</mi><mrow><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo></mrow><mo>∩</mo><mi>V</mi><mrow><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></mrow><mo>=</mo><mi>S</mi></mrow></math></span>. For an integer <span><math><mi>k</mi></math></span> with <span><math><mrow><mn>2</mn><mo>≤</mo><mi>k</mi><mo>≤</mo><mi>n</mi></mrow></math></span>, the pendant-tree <span><math><mi>k</mi></math></span>-connectivity of a graph <span><math><mi>G</mi></math></span> is defined as <span><math><mrow><msub><mrow><mi>τ</mi></mrow><mrow><mi>k</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><mi>m</mi><mi>i</mi><mi>n</mi><mrow><mo>{</mo></mrow><msub><mrow><mi>τ</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow><mo>|</mo><mi>S</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> and <span><math><mrow><mo>|</mo><mi>S</mi><mo>|</mo><mo>=</mo><mi>k</mi><mrow><mo>}</mo></mrow></mrow></math></span>, where <span><math><mrow><msub><mrow><mi>τ</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow></mrow></math></span> denotes the maximum number <span><math><mi>r</mi></math></span> of internally disjoint pendant <span><math><mi>S</mi></math></span>-trees in <span><math><mi>G</mi></math></span>. The pendant-tree <span><math><mi>k</mi></math></span>-connectivity is a generalization of traditional connectivity. In this paper, we mainly investigate the pendant-tree 4-connectivity of the regular graph with given properties, denoted by <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, which was introduced in Zhao and Hao (2019). As applications of the main result, the pendant-tree 4
{"title":"The pendant-tree connectivity of some regular graphs","authors":"Shu-Li Zhao, Bao-Cheng Zhang","doi":"10.1016/j.dam.2026.01.005","DOIUrl":"10.1016/j.dam.2026.01.005","url":null,"abstract":"<div><div>Let <span><math><mi>G</mi></math></span> be a connected graph, <span><math><mrow><mi>S</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> and <span><math><mrow><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow><mo>≥</mo><mn>2</mn></mrow></math></span>, a tree <span><math><mi>T</mi></math></span> in <span><math><mi>G</mi></math></span> is called a pendant <span><math><mi>S</mi></math></span>-tree if <span><math><mrow><mi>S</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math></span> and the degree of each vertex in <span><math><mi>S</mi></math></span> is equal to one. Two pendant <span><math><mi>S</mi></math></span>-trees <span><math><msub><mrow><mi>T</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> and <span><math><msub><mrow><mi>T</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> are called internally disjoint if <span><math><mrow><mi>E</mi><mrow><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo></mrow><mo>∩</mo><mi>E</mi><mrow><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></mrow><mo>=</mo><mo>0̸</mo></mrow></math></span> and <span><math><mrow><mi>V</mi><mrow><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo></mrow><mo>∩</mo><mi>V</mi><mrow><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></mrow><mo>=</mo><mi>S</mi></mrow></math></span>. For an integer <span><math><mi>k</mi></math></span> with <span><math><mrow><mn>2</mn><mo>≤</mo><mi>k</mi><mo>≤</mo><mi>n</mi></mrow></math></span>, the pendant-tree <span><math><mi>k</mi></math></span>-connectivity of a graph <span><math><mi>G</mi></math></span> is defined as <span><math><mrow><msub><mrow><mi>τ</mi></mrow><mrow><mi>k</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><mi>m</mi><mi>i</mi><mi>n</mi><mrow><mo>{</mo></mrow><msub><mrow><mi>τ</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow><mo>|</mo><mi>S</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> and <span><math><mrow><mo>|</mo><mi>S</mi><mo>|</mo><mo>=</mo><mi>k</mi><mrow><mo>}</mo></mrow></mrow></math></span>, where <span><math><mrow><msub><mrow><mi>τ</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow></mrow></math></span> denotes the maximum number <span><math><mi>r</mi></math></span> of internally disjoint pendant <span><math><mi>S</mi></math></span>-trees in <span><math><mi>G</mi></math></span>. The pendant-tree <span><math><mi>k</mi></math></span>-connectivity is a generalization of traditional connectivity. In this paper, we mainly investigate the pendant-tree 4-connectivity of the regular graph with given properties, denoted by <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, which was introduced in Zhao and Hao (2019). As applications of the main result, the pendant-tree 4","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 352-360"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145980016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-13DOI: 10.1016/j.dam.2025.12.054
Deqing Xu , Bo Deng , HongJian Lai
The Tutte polynomial of a graph is a fundamental invariant that effectively reflects certain characteristics and properties of the graph, which is also a very important tool for studying other graph parameters. By assigning values to the two variables in the Tutte polynomial, one can obtain combinatorial interpretations of various graph parameters such as the number of spanning trees. It is well known that the computation of the Tutte polynomial of a graph is NP-hard. In this research, a matrix–vector multiplication algorithm with the computational complexity is given to compute the Tutte polynomial for a pericondensed system with hexagons. And the matrix–vector multiplication is used to derive the precise formulation of the Tutte polynomials for single interior pericondensed hexagonal systems, which are applied to explore their spanning trees, chromatic polynomial and flow polynomial.
{"title":"Tutte polynomials of single interior pericondensed hexagonal systems","authors":"Deqing Xu , Bo Deng , HongJian Lai","doi":"10.1016/j.dam.2025.12.054","DOIUrl":"10.1016/j.dam.2025.12.054","url":null,"abstract":"<div><div>The Tutte polynomial of a graph is a fundamental invariant that effectively reflects certain characteristics and properties of the graph, which is also a very important tool for studying other graph parameters. By assigning values to the two variables in the Tutte polynomial, one can obtain combinatorial interpretations of various graph parameters such as the number of spanning trees. It is well known that the computation of the Tutte polynomial of a graph is NP-hard. In this research, a matrix–vector multiplication algorithm with the computational complexity <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mo>log</mo><mi>N</mi><mo>)</mo></mrow></mrow></math></span> is given to compute the Tutte polynomial for a pericondensed system with <span><math><mi>N</mi></math></span> hexagons. And the matrix–vector multiplication is used to derive the precise formulation of the Tutte polynomials for single interior pericondensed hexagonal systems, which are applied to explore their spanning trees, chromatic polynomial and flow polynomial.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 326-339"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145980017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-07DOI: 10.1016/j.dam.2025.12.051
Junqing Cai , Meirun Chen , Cheng-Kuan Lin
The hypercube and folded hypercube serve as fundamental interconnection network topologies in parallel computing, valued for their efficient communication and inherent fault tolerance. This paper investigates their resilience to dimensional-edge faults with respect to three critical Hamiltonian properties: Hamiltonicity, Hamiltonian laceability, and hyper Hamiltonian laceability. We establish precise bounds for fault tolerance in these structures, proving that: (1) For , both the dimensional-edge fault-tolerant Hamiltonicity and Hamiltonian laceability equal , while hyper Hamiltonian laceability tolerates up to ; (2) For , the dimensional-edge fault-tolerant Hamiltonicity is ; (3) For odd-dimensional , the dimensional-edge fault-tolerant Hamiltonian laceability and hyper Hamiltonian laceability are and , respectively. These results significantly advance our understanding of fault tolerance in cube-based network topologies and provide rigorous theoretical guarantees for their reliable operation in practical systems.
{"title":"Dimensional edge fault-tolerant Hamiltonicity of (folded) hypercubes","authors":"Junqing Cai , Meirun Chen , Cheng-Kuan Lin","doi":"10.1016/j.dam.2025.12.051","DOIUrl":"10.1016/j.dam.2025.12.051","url":null,"abstract":"<div><div>The hypercube <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> and folded hypercube <span><math><mrow><mi>F</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> serve as fundamental interconnection network topologies in parallel computing, valued for their efficient communication and inherent fault tolerance. This paper investigates their resilience to dimensional-edge faults with respect to three critical Hamiltonian properties: Hamiltonicity, Hamiltonian laceability, and hyper Hamiltonian laceability. We establish precise bounds for fault tolerance in these structures, proving that: (1) For <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, both the dimensional-edge fault-tolerant Hamiltonicity and Hamiltonian laceability equal <span><math><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>−</mo><mi>n</mi></mrow></math></span>, while hyper Hamiltonian laceability tolerates up to <span><math><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>−</mo><mn>2</mn><mi>n</mi><mo>+</mo><mn>2</mn></mrow></math></span>; (2) For <span><math><mrow><mi>F</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span>, the dimensional-edge fault-tolerant Hamiltonicity is <span><math><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup><mo>−</mo><mi>n</mi></mrow></math></span>; (3) For odd-dimensional <span><math><mrow><mi>F</mi><msub><mrow><mi>Q</mi></mrow><mrow><mn>2</mn><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msub></mrow></math></span>, the dimensional-edge fault-tolerant Hamiltonian laceability and hyper Hamiltonian laceability are <span><math><mrow><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup><mo>−</mo><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn></mrow></math></span> and <span><math><mrow><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup><mo>−</mo><mn>4</mn><mi>n</mi></mrow></math></span>, respectively. These results significantly advance our understanding of fault tolerance in cube-based network topologies and provide rigorous theoretical guarantees for their reliable operation in practical systems.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"384 ","pages":"Pages 154-164"},"PeriodicalIF":1.0,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145928893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号