Extremal function of two independent chorded cycles in a bipartite graph

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation Pub Date : 2024-12-27 DOI:10.1016/j.amc.2024.129253

Panpan Cheng, Yunshu Gao

引用次数: 0

Abstract

Let G be a bipartite graph. In this paper, by constructing two extremal graphs, we completely determine the minimum number of edges of G that guaranteeing the existence of two independent chorded cycles. As a byproduct, our result also implies that G contains two independent cycles of different lengths.

查看原文本刊更多论文

二部图中两个独立弦环的极值函数

设G是一个二部图。本文通过构造两个极值图，完整地确定了保证两个独立弦环存在的G的最小边数。作为副产品，我们的结果还表明G包含两个不同长度的独立循环。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Applied Mathematics and Computation 数学-应用数学

CiteScore

7.90

自引率

10.00%

发文量

755

审稿时长

36 days

期刊介绍： Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.