Discrete Applied Mathematics最新文献_第6页

Perfect matchings of (4,6)-fullerenes with largest forcing number 具有最大强迫数的(4,6)-富勒烯完美匹配

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-21 DOI: 10.1016/j.dam.2025.04.004

Yaxian Zhang, Heping Zhang

引用次数: 0

Matching polynomials of path-trees of a complete bipartite graph 完整双向图路径树的匹配多项式

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-21 DOI: 10.1016/j.dam.2025.04.014

Haiyan Chen , Yinxia Yuan

引用次数: 0

Unit dual quaternion directed graphs, formation control and general weighted directed graphs 单位对偶四元数有向图，编队控制和一般加权有向图

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-21 DOI: 10.1016/j.dam.2025.04.027

Liqun Qi , Chunfeng Cui , Chen Ouyang

引用次数: 0

An (F3,F4)-partition of planar graphs without 4- and 6-cycles 无4圈和6圈的平面图的（F3,F4）划分

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-21 DOI: 10.1016/j.dam.2025.04.018

Kaiyang Hu, Mingfang Huang

引用次数: 0

Two-disjoint-cycle-cover pancyclicity of augmented cubes 增广立方体的两不相交环盖环性

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-20 DOI: 10.1016/j.dam.2025.04.033

Dongqin Cheng

引用次数: 0

Proof of a conjecture on isolation of graphs dominated by a vertex 一个由顶点支配的图的隔离猜想的证明

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-19 DOI: 10.1016/j.dam.2025.04.009

Peter Borg

引用次数: 0

Sufficient conditions for k-factors and spanning trees of graphs 图的k因子和生成树的充分条件

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-19 DOI: 10.1016/j.dam.2025.04.015

Guoyan Ao , Ruifang Liu , Jinjiang Yuan , C.T. Ng , T.C.E. Cheng

{"title":"Sufficient conditions for k-factors and spanning trees of graphs","authors":"Guoyan Ao , Ruifang Liu , Jinjiang Yuan , C.T. Ng , T.C.E. Cheng","doi":"10.1016/j.dam.2025.04.015","DOIUrl":"10.1016/j.dam.2025.04.015","url":null,"abstract":"<div><div>For any integer <math><mrow><mi>k</mi><mo>≥</mo><mn>1</mn><mo>,</mo></mrow></math> a graph <math><mi>G</mi></math> has a <math><mi>k</mi></math>-factor if it contains a <math><mi>k</mi></math>-regular spanning subgraph. In this paper, we present a sufficient condition in terms of the number of <math><mi>r</mi></math>-cliques to guarantee the existence of a <math><mi>k</mi></math>-factor in a graph with minimum degree at least <math><mi>δ</mi></math>, which improves the sufficient condition of O (2021) based on the number of edges. For any integer <math><mrow><mi>k</mi><mo>≥</mo><mn>2</mn><mo>,</mo></mrow></math> a spanning <math><mi>k</mi></math>-tree of a connected graph <math><mi>G</mi></math> is a spanning tree in which every vertex has degree at most <math><mi>k</mi></math>. Motivated by the technique of Li and Ning (2016), we present a tight spectral condition for an <math><mi>m</mi></math>-connected graph to have a spanning <math><mi>k</mi></math>-tree, which extends the result of Fan et al. (2022) from <math><mrow><mi>m</mi><mo>=</mo><mn>1</mn></mrow></math> to general <math><mi>m</mi></math>. Let <math><mi>T</mi></math> be a spanning tree of a connected graph. The leaf degree of <math><mi>T</mi></math> is the maximum number of leaves adjacent to <math><mi>v</mi></math> in <math><mi>T</mi></math> for any <math><mrow><mi>v</mi><mo>∈</mo><mi>V</mi><mrow><mo>(</mo><mi>T</mi><mo>)</mo></mrow></mrow></math>. We provide a tight spectral condition for the existence of a spanning tree with leaf degree at most <math><mi>k</mi></math> in a connected graph with minimum degree <math><mi>δ</mi></math>, where <math><mrow><mi>k</mi><mo>≥</mo><mn>1</mn></mrow></math> is an integer.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"372 ","pages":"Pages 124-135"},"PeriodicalIF":1.0,"publicationDate":"2025-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143848585","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}

引用次数: 0

The largest eigenvalue of C−k-free signed graphs 无C−k符号图的最大特征值

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-19 DOI: 10.1016/j.dam.2025.04.037

Yongang Wang, Huiqiu Lin

引用次数: 0

Nordhaus–Gaddum decompositions for group coloring and DP coloring 群着色和DP着色的Nordhaus-Gaddum分解

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-04-19 DOI: 10.1016/j.dam.2025.04.034

Allan Bickle , Lucian Mazza

引用次数: 0

The expected values for the Kirchhoff indices in the random hexagonal-quadrilateral chain and its spiro chain 随机六边形-四边形链及其螺旋链的基尔霍夫指数期望值