相关论文: Towards a Characterization of Leaf Powers by Cliqu…

A graph $G$ is a {\em chordal-$k$-generalized split graph} if $G$ is chordal and there is a clique $Q$ in $G$ such that every connected component in $G[V \setminus Q]$ has at most $k$ vertices. Thus, chordal-$1$-generalized split graphs are…

A graph is inductive $k$-independent if there exists and ordering of its vertices $v_{1},...,v_{n}$ such that $\alpha(G[N(v_{i})\cap V_{i}])\leq k $ where $N(v_{i})$ is the neighborhood of $v_{i}$, $V_{i}=\{v_{i},...,v_{n}\}$ and $\alpha$…

A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of…

A leaf matching operation on a graph consists of removing a vertex of degree~$1$ together with its neighbour from the graph. For $k\geq 0$, let $G$ be a $d$-regular cyclically $(d-1+2k)$-edge-connected graph of even order. We prove that for…

The reduced power graph $\mathcal{RP}(G)$ of a group $G$ is the graph with vertex set $G$ and two vertices $u$ and $v$ are adjacent if and only if $\left\langle v\right\rangle \subset \left\langle u \right\rangle $ or $\left\langle…

The $k$-th $p$-power of a graph $G$ is the graph on the vertex set $V(G)^k$, where two $k$-tuples are adjacent iff the number of their coordinates which are adjacent in $G$ is not congruent to 0 modulo $p$. The clique number of powers of…

A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called localizable graphs and defined as graphs having a partition of…

Let $lct(G)$ be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2-connected graph $G$. We show that $lct(G)\leq k-1$ if $G$ is a partial $k$-tree and that $lct(G)\leq \max \{1, {\omega(G){-}3}\}$ if $G$…

A \emph{$k$-tree} is a chordal graph with no $(k+2)$-clique. An \emph{$\ell$-tree-partition} of a graph $G$ is a vertex partition of $G$ into `bags', such that contracting each bag to a single vertex gives an $\ell$-tree (after deleting…

We improve the worst-case information theoretic lower bound of Munro and Wu (ISAAC 2018) for $n-$vertex unlabeled chordal graphs when vertex leafage is bounded and leafage is unbounded. The class of unlabeled $k-$vertex leafage chordal…

We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree…

A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques in the class of diamond-free graphs, from both structural…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. stated the Linear Arboricity Conjecture (LAC), that the linear arboricity of any simple graph of maximum…

A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group $G$ is weakly perfect: its clique number and chromatic number are equal to the maximum order of an…

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…

In this paper, we study some spanning trees with bounded degree and leaf degree from eigenvalues. For any integer $k\geq2$, a $k$-tree is a spanning tree in which every vertex has degree no more than $k$. Let $T$ be a spanning tree of a…

Let $G$ be a graph and $\mathcal{K}_G$ be the set of all cliques of $G$, then the clique graph of G denoted by $K(G)$ is the graph with vertex set $\mathcal{K}_G$ and two elements $Q_i,Q_j \in \mathcal{K}_G$ form an edge if and only if $Q_i…

Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{\'a}tal et al. Note: Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics, 256, 445-448, 2002]. We…