(-k)-critical trees and k-minimal trees

TL;DR

This paper characterizes and counts specific classes of prime trees, namely $(-k)$-critical and $k$-minimal trees, providing formulas for their enumeration based on the number of vertices and the parameter $k$.

Contribution

It offers a complete description of $(-k)$-critical trees and $k$-minimal trees, including enumeration formulas for nonisomorphic cases with given vertices.

Findings

Number of nonisomorphic $(-k)$-critical trees with $n$ vertices for $k=1,2,loor{n/2}$.

Complete characterization of $k$-minimal trees for $k eq 0$.

Enumeration formulas for nonisomorphic $k$-minimal trees with $n$ vertices for $k extless= 3.

Abstract

In a graph $G=(V,E)$, a module is a vertex subset $M$ of $V$ such that every vertex outside $M$ is adjacent to all or none of $M$. For example, $\emptyset$, $\{x\}$ $(x\in V )$ and $V$ are modules of $G$, called trivial modules. A graph, all the modules of which are trivial, is prime; otherwise, it is decomposable. A vertex $x$ of a prime graph $G$ is critical if $G - x$ is decomposable. Moreover, a prime graph with $k$ non-critical vertices is called $(-k)$-critical graph. A prime graph $G$ is $k$-minimal if there is some $k$-vertex set $X$ of vertices such that there is no proper induced subgraph of $G$ containing $X$ is prime. From this perspective, I. Boudabbous proposes to find the $(-k)$-critical graphs and $k$-minimal graphs for some integer $k$ even in a particular case of graphs. This research paper attempts to answer I. Boudabbous's question. First, it describes the $(-k)$-critical tree. As a corollary, we determine the number of nonisomorphic $(-k)$-critical tree with $n$ vertices where $k\in \{1,2,\lfloor\frac{n}{2}\rfloor\}$. Second, it provide a complete characterization of the $k$-minimal tree. As a corollary, we determine the number of nonisomorphic $k$-minimal tree with $n$ vertices where $k\leq 3$.