首页/论文/2005.03335

arXiv 2005.033352020-05-07math.CO

Maximum dissociation sets in subcubic trees

Lei Zhang, Jianhua Tu, Chunlin Xin

英文摘要：

A subset of vertices in a graph $G$ is called a maximum dissociation set if it induces a subgraph with vertex degree at most 1 and the subset has maximum cardinality. The dissociation number of $G$, denoted by $ψ(G)$, is the cardinality of a maximum dissociation set. A subcubic tree is a tree of maximum degree at most 3. In this paper, we give the lower and upper bounds on the dissociation number in a subcubic tree of order $n$ and show that the number of maximum dissociation sets of a subcubic tree of order $n$ and dissociation number $ψ$ is at most $1.466^{4n-5ψ+2}$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Relating the independence number and the dissociation number

The independence number $α(G)$ and the dissociation number ${\rm diss}(G)$ of a graph $G$ are the largest orders of induced subgraphs of $G$ of maximum degree at most $0$ and at most $1$, respectively. We consider possible improvements of the obvious inequality $2α(G)\geq {\rm diss}(G)$. For connected cubic graphs $G$ distinct from $K_4$, we show $5α(G)\geq 3{\rm diss}(G)$, and describe the rich and interesting structure of the extremal graphs in detail. For bipartite graphs, and, more generally, triangle-free graphs, we also obtain improvements. For subcubic graphs though, the inequality cann…

2022-05-06math.CO

Decomposing Claw-free Subcubic Graphs and $4$-Chordal Subcubic Graphs

Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a $2$-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic graphs and $4$-chordal subcubic graphs.

2020-01-30math.CO

A bound on the dissociation number

The dissociation number ${\rm diss}(G)$ of a graph $G$ is the maximum order of a set of vertices of $G$ inducing a subgraph that is of maximum degree at most $1$. Computing the dissociation number of a given graph is algorithmically hard even when restricted to subcubic bipartite graphs. For a graph $G$ with $n$ vertices, $m$ edges, $k$ components, and $c_1$ induced cycles of length $1$ modulo $3$, we show ${\rm diss}(G)\geq n-\frac{1}{3}\Big(m+k+c_1\Big)$. Furthermore, we characterize the extremal graphs in which every two cycles are vertex-disjoint.

2022-02-18math.CO

Exponential Independence in Subcubic Graphs

A set $S$ of vertices of a graph $G$ is exponentially independent if, for every vertex $u$ in $S$, $$\sum\limits_{v\in S\setminus \{ u\}}\left(\frac{1}{2}\right)^{{\rm dist}_{(G,S)}(u,v)-1}<1,$$ where ${\rm dist}_{(G,S)}(u,v)$ is the distance between $u$ and $v$ in the graph $G-(S\setminus \{ u,v\})$. The exponential independence number $α_e(G)$ of $G$ is the maximum order of an exponentially independent set in $G$. In the present paper we present several bounds on this parameter and highlight some of the many related open problems. In particular, we prove that subcubic graphs of order $n$ hav…

2020-10-02math.CO

次立方图中的匹配补集与3-分解猜想的证明

A proof of the 3-Decomposition Conjecture

Renmin University of China（中国人民大学）

本研究证明3-分解猜想，通过次立方图匹配补集新定理，经归纳推导依次得到2-分解猜想等结论，解决相关图论分解问题。

2026-10-23math.CO

Exponential Domination in Subcubic Graphs

As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that decreases exponentially with the distance, and the dominated vertices have to accumulate a sufficient amount of this power emanating from the dominating vertices. More precisely, if $S$ is a set of vertices of a graph $G$, then $S$ is an exponential dominating set of $G$ if $\sum\limits_{v\in S}\left(\frac{1}{2}\right)^{{\rm dist}_{(G,S)}(u,v)-1}\geq 1$ for ever…

2015-11-04math.CO

更多相关论文收起更多论文

On packing chromatic number of subcubic outerplanar graphs

Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small). These subclasses include subcubic trees, base-3 Sierpi{ń}ski graphs and hexagonal lattices.In this paper we are interested in the packing chromatic number of subcubic outerplanar graphs. We provide asymptotic bounds depending on structural properties of the outerplanar graphs and determine sharper bounds for some classes of subcubic outerplanar graphs.

2018-07-27cs.DMmath.CO

On the maximum number of maximum dissociation sets in trees with given dissociation number

In a graph $G$, a subset of vertices is a dissociation set if it induces a subgraph with vertex degree at most 1. A maximum dissociation set is a dissociation set of maximum cardinality. The dissociation number of $G$, denoted by $ψ(G)$, is the cardinality of a maximum dissociation set of $G$. Extremal problems involving counting the number of a given type of substructure in a graph have been a hot topic of study in extremal graph theory throughout the last few decades. In this paper, we determine the maximum number of maximum dissociation sets in a tree with prescribed dissociation number and…

2021-08-25math.CO

Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree

In a graph G, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-hard even for bipartite graphs and is called the maximum dissociation set problem. The complexity of maximum dissociation set problem in various subclasses of graphs has been extensively studied in the literature. In this paper, we study the maximum dissociation problem from different perspectives and characterize the vertices belonging to all maximum dissociation sets, and to no maximum dissociation set of a tree. We…

2021-07-30math.CO

树中极大解离集数量的上界

Upper bound for the number of maximal dissociation sets in trees

本文研究树中极大解离集的计数上界，证明阶数 $n\geq4$ 的树满足 $Φ(T)\leq 3^{(n-1)/3}+(n-1)/3$，并刻画极值树及森林中的第二大值。

2024-10-27math.CO

关于具有给定 dissociation number $φ$ 的树的 extremal Sombor index

On extremal Sombor index of trees with a given dissociation number $φ$

本文研究了具有给定 dissociation number $φ$ 的树的最大 Sombor index 问题，确定了阶为 $\mathbf{n}$ 的树的最大值，并给出了取得该最大值的唯一图。

2025-08-11math.CO

The maximum number of maximum dissociation sets in trees

A subset of vertices is a {\it maximum independent set} if no two of the vertices are adjacent and the subset has maximum cardinality. A subset of vertices is called a {\it maximum dissociation set} if it induces a subgraph with vertex degree at most 1, and the subset has maximum cardinality. Zito [J. Graph Theory {\bf 15} (1991) 207--221] proved that the maximum number of maximum independent sets of a tree of order $n$ is $2^{\frac{n-3}{2}}$ if $n$ is odd, and $2^{\frac{n-2}{2}}+1$ if $n$ is even and also characterized all extremal trees with the most maximum independent sets, which solved a …

2020-08-27math.CO

树中极大解离集的最大数量

The maximum number of maximal dissociation sets in trees

Beijing Normal University（北京师范大学）

本文针对树中极大解离集的最大数量问题，研究Wang等人2025年提出的猜想，给出阶数$n\boldsymbol{\text{≥}}3$的树中该数量的分段函数表达式，并刻画对应的极值树。

2026-08-18math.CO

具有给定解离数并达到最小谱半径的连通图

Connected graphs with a given dissociation number attaining the minimum spectral radius

本文研究给定解离数下谱半径最小的$n$阶连通图，刻画了解离数取若干特定值时的极值图，并证明解离数大于$\lceil2n/3\rceil$时极值图为树。

2023-09-27math.CO

关于具有给定阶数和分离数的图的$A_α$-指标

On the $A_α$-index of graphs with given order and dissociation number

本文研究了在给定阶数和分离数条件下图的$A_α$-指标极值问题，确定了具有最大和最小$A_α$-指标的连通图、二部图及树的结构。

2024-03-27math.CO

导出子图与树分解 II：有界度图中墙及其线图的研究

Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree

本文研究大树宽有界度图的不可避免导出子图，证明了两个支持Aboulker等人猜想的定理：一是大树宽有界度图必含t-theta、t-pyramid或墙细分线图作为导出子图，二是必含给定次立方细分毛毛虫或其细分线图作为导出子图。

2023-10-30math.CO

禁子图复杂性框架III：次立方图上问题可解的情形

Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs

该研究延续禁子图复杂性框架的元分类工作，聚焦次立方图上的多项式可解图问题，得到多个经典图问题的全面复杂性分类，解决了若干开放问题。

2023-05-01cs.DSmath.CO

On the maximum number of maximum independent sets

We give a very short and simple proof of Zykov's generalization of Turán's theorem, which implies that the number of maximum independent sets of a graph of order $n$ and independence number $α$ with $α<n$ is at most $\left\lceil\frac{n}α\right\rceil^{n\,{\rm mod}\,α} \left\lfloor\frac{n}α\right\rfloor^{α-(n\,{\rm mod}\,α)}$. Generalizing a result of Zito, we show that the number of maximum independent sets of a tree of order $n$ and independence number $α$ is at most $2^{n-α-1}+1$, if $2α=n$, and, $2^{n-α-1}$, if $2α>n$, and we also characterize the extremal graphs. Finally, we show that the n…

2018-05-07math.CO

连通图中分离集的数量

The number of dissociation sets in connected graphs

本文研究了连通图中分离集的极值枚举问题，提出了增加分离集数量的有效工具，确定了阶为$n$的连通图和树中分离集的最大数量及极值图，并找出了具有第二大分离集数量的单圈图候选。

2024-12-22math.CO

On the Clar Number of Benzenoid Graphs

A Clar set of a benzenoid graph $B$ is a maximum set of independent alternating hexagons over all perfect matchings of $B$. The Clar number of $B$, denoted by ${\rm Cl}(B)$, is the number of hexagons in a Clar set for $B$. In this paper, we first prove some results on the independence number of subcubic trees to study the Clar number of catacondensed benzenoid graphs. As the main result of the paper we prove an upper bound for the Clar number of catacondensed benzenoid graphs and characterize the graphs that attain this bound. More precisely, it is shown that for a catacondensed benzenoid grap…

2017-09-13math.CO

平面（有向）图划分为一个连通无环集与一个独立集的划分问题

Partitions of planar (oriented) graphs into a connected acyclic and an independent set

围绕欧拉有向平面图的顶点划分交叉问题，研究CAI-划分的存在性，证明两类图存在该划分，并构造反例将已有结果推广至有向场景。

2025-10-29cs.DMmath.CO