Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total

IF 0.4 4区数学 Q4 MATHEMATICS

Studia Scientiarum Mathematicarum Hungarica Pub Date : 2022-04-01 DOI:10.1556/012.2022.01521

D. D. Hanh

引用次数: 1

Abstract

A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree at least three. In this paper, we show a degree condition for a claw-free graph to have spanning trees with at most five branch vertices and leaves in total. Moreover, the degree sum condition is best possible.

查看原文本刊更多论文

无爪图最多有5个分支顶点和叶的生成树的度条件

树的叶子是一阶顶点，树的分支顶点是至少三阶顶点。本文给出了无爪图生成树最多有5个分支顶点和叶子的一个度条件。而且，度和条件是最好的。

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

求助全文

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

来源期刊

Studia Scientiarum Mathematicarum Hungarica 数学-数学

CiteScore

1.30

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The journal publishes original research papers on various fields of mathematics, e.g., algebra, algebraic geometry, analysis, combinatorics, dynamical systems, geometry, mathematical logic, mathematical statistics, number theory, probability theory, set theory, statistical physics and topology.