vol. 24, no 2


1. Further results on Hendry's Conjecture

Manuel Lafond ; Ben Seamone ; Rezvan Sherkati.
Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing that it fails to hold even when a number of extra conditions are imposed. In particular, we show that Hendry's Conjecture fails for strongly chordal graphs, graphs with high connectivity, and if we relax the definition of "cycle extendible" considerably. We also consider the original conjecture from a subtree intersection model point of view, showing that a result of Abuieda et al is nearly best possible.
Section: Graph Theory

2. On the domination number of $t$-constrained de Bruijn graphs

Tiziana Calamoneri ; Angelo Monti ; Blerina Sinaimeri.
Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs (directed and undirected), namely $t$-constrained de Bruijn graphs, where $t$ is a positive integer, and then study the domination number of these graphs. Within the definition of $t$-constrained de Bruijn graphs, de Bruijn and Kautz graphs correspond to 1-constrained and 2-constrained de Bruijn graphs, respectively. This generalization inherits many structural properties of de Bruijn graphs and may have similar applications in interconnection networks or bioinformatics. We establish upper and lower bounds for the domination number on $t$-constrained de Bruijn graphs both in the directed and in the undirected case. These bounds are often very close and in some cases we are able to find the exact value.
Section: Graph Theory

3. On the monophonic rank of a graph

Mitre C. Dourado ; Vitor S. Ponciano ; RĂ´mulo L. O. da Silva.
A set of vertices $S$ of a graph $G$ is {\em monophonically convex} if every induced path joining two vertices of $S$ is contained in $S$. The {\em monophonic convex hull of $S$}, $\langle S \rangle$, is the smallest monophonically convex set containing $S$. A set $S$ is {\em monophonic convexly independent} if $v \not\in \langle S - \{v\} \rangle$ for every $v \in S$. The {\em monophonic rank} of $G$ is the size of the largest monophonic convexly independent set of $G$. We present a characterization of the monophonic convexly independent sets. Using this result, we show how to determine the monophonic rank of graph classes like bipartite, cactus, triangle-free, and line graphs in polynomial time. Furthermore, we show that this parameter can computed in polynomial time for $1$-starlike graphs, i.e., for split graphs, and that its determination is $\NP$-complete for $k$-starlike graphs for any fixed $k \ge 2$, a subclass of chordal graphs. We also consider this problem on the graphs whose intersection graph of the maximal prime subgraphs is a tree.
Section: Graph Theory