IF 2.9 2区数学

Computers & Mathematics with Applications Pub Date : 2025-07-03 DOI: 10.1016/j.camwa.2025.06.017

Yangfan Cao , Hanshu Chen , Jakub Krzysztof Grabski , Zhuojia Fu

引用次数: 0

Fractional distortion in hyperbolic groups 双曲群中的分数畸变

IF 1.5 1区数学

Advances in Mathematics Pub Date : 2025-07-03 DOI: 10.1016/j.aim.2025.110418

Pallavi Dani , Timothy Riley

引用次数: 0

An identifying operation on a 1-planar graph with an application to acyclic coloring 一种应用于无环着色的1-平面图上的识别操作

IF 3.5 2区数学

Applied Mathematics and Computation Pub Date : 2025-07-03 DOI: 10.1016/j.amc.2025.129614

Qiuyue Tan , Haizhen Qiu , Yiqiao Wang , Kan Wang

{"title":"An identifying operation on a 1-planar graph with an application to acyclic coloring","authors":"Qiuyue Tan , Haizhen Qiu , Yiqiao Wang , Kan Wang","doi":"10.1016/j.amc.2025.129614","DOIUrl":"10.1016/j.amc.2025.129614","url":null,"abstract":"<div><div>This paper introduces a graph operation and gives its applications. Given a 1-plane graph M and its crossing point x formed by two crossing edges <math><mi>u</mi><msup><mrow><mi>u</mi></mrow><mrow><mo>′</mo></mrow></msup></math> and <math><mi>v</mi><msup><mrow><mi>v</mi></mrow><mrow><mo>′</mo></mrow></msup></math>, an Identifying Operation with respect to x is defined in two steps: (1) identifying u and v such that x vanishes; (2) deleting loops and multi-edges (if exists). Using Identifying Operation to every crossing point, we change M into its associated plane graph <math><msup><mrow><mi>M</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math>. Under some conditions, we show that <math><msub><mrow><mi>χ</mi></mrow><mrow><mi>a</mi></mrow></msub><mo>(</mo><mi>M</mi><mo>)</mo><mo>≤</mo><mn>2</mn><msub><mrow><mi>χ</mi></mrow><mrow><mi>a</mi></mrow></msub><mo>(</mo><msup><mrow><mi>M</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>)</mo></math>, where the parameters <math><msub><mrow><mi>χ</mi></mrow><mrow><mi>a</mi></mrow></msub><mo>(</mo><mi>M</mi><mo>)</mo></math> and <math><msub><mrow><mi>χ</mi></mrow><mrow><mi>a</mi></mrow></msub><mo>(</mo><msup><mrow><mi>M</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>)</mo></math> represent the acyclic-chromatic-number of M and <math><msup><mrow><mi>M</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math>, respectively. This generalizes a result established by Yang et al. in 2018.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"508 ","pages":"Article 129614"},"PeriodicalIF":3.5,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144535096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhancing the topological robustness of supply chain networks against dynamic disruptions: A complex adaptive system perspective 增强供应链网络对动态中断的拓扑鲁棒性：一个复杂自适应系统的观点

IF 5.3 1区数学

Chaos Solitons & Fractals Pub Date : 2025-07-03 DOI: 10.1016/j.chaos.2025.116767

Jiepeng Wang , Peng Qin , Li Chen , Changgui Gu , Yufei Yuan , Hong Zhou

{"title":"Enhancing the topological robustness of supply chain networks against dynamic disruptions: A complex adaptive system perspective","authors":"Jiepeng Wang , Peng Qin , Li Chen , Changgui Gu , Yufei Yuan , Hong Zhou","doi":"10.1016/j.chaos.2025.116767","DOIUrl":"10.1016/j.chaos.2025.116767","url":null,"abstract":"<div><div>With growing disruptions, uncertainties, and complex risks like pandemics, natural disasters, and geopolitical tensions, firms must ensure supply chain continuity, quick recovery, and agility in responding to market needs. As a result, designing resilient supply chain networks (SCNs) has become both essential and highly important. To address this problem, based on the complex adaptive system (CAS) theory and by modifying the Barabási and Albert (BA) model, a supply chain network evolving (SCNE) model with adaptive strategies is designed, which considers firms’ edges growth and rewiring strategies. Utilizing mean-field theory, the SCNE model is analyzed and subjected to simulation studies to verify its scale-free properties. It also examines the structural characteristics of SCN evolution under different adaptive strategies. Subsequently, a case study of Acura automobile SCN is conducted for topological robustness analysis. Finally, the results of the simulation are validated using an ordinary least squares (OLS) regression model, demonstrating the effectiveness of adaptive strategies in enhancing the topological robustness of SCNs. We find that the enhancement of SCN topological robustness can be achieved through firms’ edges growth and rewiring strategies in response to node removal disruptions. Quantitatively, firms’ edges growth strategies improve SCN topological robustness approximately 2.1 times more than rewiring strategies, as indicated by the coefficients of 0.81 and 0.75 for largest connected component size and network efficiency, respectively, compared to 0.38 and 0.37 for rewiring strategies. These findings underscore the critical role of adaptive strategies in enhancing the resilience of SCNs.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"199 ","pages":"Article 116767"},"PeriodicalIF":5.3,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144534994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Paired-domination in binary trees 二叉树中的配对支配

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-07-03 DOI: 10.1016/j.dam.2025.06.038

Aaron D. Gray , Michael A. Henning

引用次数: 0

Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs — A survey 图的完美匹配的强迫、反强迫、整体强迫和完全强迫——综述

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-07-03 DOI: 10.1016/j.dam.2025.06.022

Yaxian Zhang , Xin He , Qianqian Liu , Heping Zhang

引用次数: 0

Global well-posedness of the nonhomogeneous incompressible Navier-Stokes-Cahn-Hilliard system with Landau Potential 具有朗道势的非齐次不可压缩Navier-Stokes-Cahn-Hilliard系统的全局适定性

IF 2.4 2区数学

Journal of Differential Equations Pub Date : 2025-07-03 DOI: 10.1016/j.jde.2025.113585

Li Fang , Rui Nei , Zhenhua Guo

{"title":"Global well-posedness of the nonhomogeneous incompressible Navier-Stokes-Cahn-Hilliard system with Landau Potential","authors":"Li Fang , Rui Nei , Zhenhua Guo","doi":"10.1016/j.jde.2025.113585","DOIUrl":"10.1016/j.jde.2025.113585","url":null,"abstract":"<div><div>We study the nonhomogeneous incompressible Navier-Stokes-Cahn-Hilliard system in a bounded smooth domain in <math><msup><mrow><mi>R</mi></mrow><mrow><mn>3</mn></mrow></msup></math>, which describes the dynamics of nonhomogeneous incompressible two-phase viscous flows. We first give a blow-up criterion of local strong solution to the initial-boundary-value problem for the case of initial density away from zero. After establishing some key a priori with the help of the Landau Potential, we obtain the global existence and the decay-in-time of strong solution, provided that the initial datum <math><msub><mrow><mo>‖</mo><mi>∇</mi><msub><mrow><mi>u</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>‖</mo></mrow><mrow><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>(</mo><mi>Ω</mi><mo>)</mo></mrow></msub><mo>+</mo><msub><mrow><mo>‖</mo><mi>∇</mi><msub><mrow><mi>μ</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>‖</mo></mrow><mrow><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>(</mo><mi>Ω</mi><mo>)</mo></mrow></msub><mo>+</mo><msub><mrow><mo>‖</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>‖</mo></mrow><mrow><msup><mrow><mi>L</mi></mrow><mrow><mo>∞</mo></mrow></msup><mo>(</mo><mi>Ω</mi><mo>)</mo></mrow></msub></math> is suitably small. Precisely, we provide a systematic analysis of the Navier-Stokes-Cahn-Hilliard system through detailed a priori estimates, covering blow-up criterion, global existence and decay behavior of strong solutions.</div></div>","PeriodicalId":15623,"journal":{"name":"Journal of Differential Equations","volume":"445 ","pages":"Article 113585"},"PeriodicalIF":2.4,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144534438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Periodic solutions for the coupled wave equations with concave-convex nonlinearities 凹凸非线性耦合波动方程的周期解

IF 2.4 2区数学

Journal of Differential Equations Pub Date : 2025-07-03 DOI: 10.1016/j.jde.2025.113584

Jianhua Liu, Jiayu Deng, Shuguan Ji

引用次数: 0

A generalization of the Hamiltonian cycle in dense digraphs 密有向图中哈密顿循环的推广

IF 1 3区数学

Discrete Applied Mathematics Pub Date : 2025-07-03 DOI: 10.1016/j.dam.2025.06.021

Jie Zhang , Zhilan Wang , Jin Yan

{"title":"A generalization of the Hamiltonian cycle in dense digraphs","authors":"Jie Zhang , Zhilan Wang , Jin Yan","doi":"10.1016/j.dam.2025.06.021","DOIUrl":"10.1016/j.dam.2025.06.021","url":null,"abstract":"<div><div>Let <math><mi>D</mi></math> be a digraph and <math><mi>C</mi></math> be a cycle in <math><mi>D</mi></math>. For any two vertices <math><mi>x</mi></math> and <math><mi>y</mi></math> in <math><mi>D</mi></math>, the distance from <math><mi>x</mi></math> to <math><mi>y</mi></math> is defined as the minimum length of a directed path from <math><mi>x</mi></math> to <math><mi>y</mi></math>. The square of the cycle <math><mi>C</mi></math> is the graph with vertex set <math><mrow><mi>V</mi><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></mrow></math>, where for distinct vertices <math><mi>x</mi></math> and <math><mi>y</mi></math> in <math><mi>C</mi></math>, there is an arc from <math><mi>x</mi></math> to <math><mi>y</mi></math> if and only if the distance from <math><mi>x</mi></math> to <math><mi>y</mi></math> in <math><mi>C</mi></math> is at most 2. The reverse square of the cycle <math><mi>C</mi></math> is the digraph with vertex set <math><mrow><mi>V</mi><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></mrow></math>, and arc set <math><mrow><mi>A</mi><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow><mo>∪</mo><mrow><mo>{</mo><mi>y</mi><mi>x</mi><mo>:</mo><mtext>the vertices</mtext><mspace></mspace><mi>x</mi><mo>,</mo><mi>y</mi><mo>∈</mo><mi>V</mi><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow><mspace></mspace><mtext>and the distance from </mtext><mi>x</mi><mtext> to </mtext><mi>y</mi><mtext> in </mtext><mi>C</mi><mtext> is </mtext><mn>2</mn><mo>}</mo></mrow></mrow></math>. In this paper, we prove that for every real number <math><mrow><mi>γ</mi><mo>></mo><mn>0</mn></mrow></math>, there exists a positive integer <math><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>=</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>0</mn></mrow></msub><mrow><mo>(</mo><mi>γ</mi><mo>)</mo></mrow></mrow></math> such that every digraph on <math><mrow><mi>n</mi><mo>≥</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>0</mn></mrow></msub></mrow></math> vertices with the minimum in- and out-degree at least <math><mrow><mrow><mo>(</mo><mn>2</mn><mo>/</mo><mn>3</mn><mo>+</mo><mi>γ</mi><mo>)</mo></mrow><mi>n</mi></mrow></math> contains the reverse square of a Hamiltonian cycle. This result generalizes a theorem of Czygrinow, Kierstead and Molla.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"377 ","pages":"Pages 1-9"},"PeriodicalIF":1.0,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144534399","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

Combinatorial Ricci flow and Calabi flow for generalized hyperbolic circle packings 广义双曲圆填料的组合Ricci流和Calabi流

IF 1.3 2区数学

Nonlinear Analysis-Theory Methods & Applications Pub Date : 2025-07-02 DOI: 10.1016/j.na.2025.113894

Yu Sun , Kai Wang , Xiaorui Yang , Hao Yu

引用次数: 0

数学最新文献