102 research outputs found
Obstructions to Faster Diameter Computation: Asteroidal Sets
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbourhood does not increase the number of connected components. Let be the class of all connected graphs whose quotient graph obtained from modular decomposition contains no more than pairwise nonadjacent extremities. Our main contributions are as follows. First, we prove that the diameter of every -edge graph in can be computed in deterministic time. We then improve the runtime to linear for all graphs with bounded clique-number. Furthermore, we can compute an additive -approximation of all vertex eccentricities in deterministic time. This is in sharp contrast with general -edge graphs for which, under the Strong Exponential Time Hypothesis (SETH), one cannot compute the diameter in time for any . As important special cases of our main result, we derive an -time algorithm for exact diameter computation within dominating pair graphs of diameter at least six, and an -time algorithm for this problem on graphs of asteroidal number at most . We end up presenting an improved algorithm for chordal graphs of bounded asteroidal number, and a partial extension of our results to the larger class of all graphs with a dominating target of bounded cardinality. Our time upper bounds in the paper are shown to be essentially optimal under plausible complexity assumptions
Linear Time LexDFS on Cocomparability Graphs
Lexicographic depth first search (LexDFS) is a graph search protocol which
has already proved to be a powerful tool on cocomparability graphs.
Cocomparability graphs have been well studied by investigating their
complements (comparability graphs) and their corresponding posets. Recently
however LexDFS has led to a number of elegant polynomial and near linear time
algorithms on cocomparability graphs when used as a preprocessing step [2, 3,
11]. The nonlinear runtime of some of these results is a consequence of
complexity of this preprocessing step. We present the first linear time
algorithm to compute a LexDFS cocomparability ordering, therefore answering a
problem raised in [2] and helping achieve the first linear time algorithms for
the minimum path cover problem, and thus the Hamilton path problem, the maximum
independent set problem and the minimum clique cover for this graph family
Boundes for Boxicity of some classes of graphs
Let be the boxicity of a graph , be the
-generalized join graph of -pairwise disjoint graphs , be a circular clique graph (where ) and be
the zero-divisor graph of a commutative ring . In this paper, we prove that
, for all and with . This
generalizes the results proved in \cite{Aki}. Also we obtain that
box(G[H_1,H_2,\ldots,H_n])\leq \mathop\sum\limits_{i=1}^nbox(H_i). As a
consequence of this result, we obtain a bound for boxicity of zero-divisor
graph of a finite commutative ring with unity. In particular, if is a
finite commutative non-zero reduced ring with unity, then . where is the
chromatic number of . Moreover, we show that if is a
composite number, where 's and 's are distinct prime numbers, then
box(\Gamma(\mathbb{Z}_N))\leq
\big(\mathop\prod\limits_{i=1}^{a}(2n_i+1)\mathop\prod\limits_{j=1}^{b}(2m_j+2)\big)-\big(\mathop\prod\limits_{i=1}^{a}(n_i+1)\mathop\prod\limits_{j=1}^{b}(m_j+1)\big)-1,
where is the ring of integers modulo . Further, we prove
that, if and only if either for some
prime number and some positive integer or for some odd
prime number
Comparing Width Parameters on Graph Classes
We study how the relationship between non-equivalent width parameters changes
once we restrict to some special graph class. As width parameters, we consider
treewidth, clique-width, twin-width, mim-width, sim-width and tree-independence
number, whereas as graph classes we consider -subgraph-free graphs,
line graphs and their common superclass, for , of -free
graphs.
We first provide a complete comparison when restricted to
-subgraph-free graphs, showing in particular that treewidth,
clique-width, mim-width, sim-width and tree-independence number are all
equivalent. This extends a result of Gurski and Wanke (2000) stating that
treewidth and clique-width are equivalent for the class of
-subgraph-free graphs.
Next, we provide a complete comparison when restricted to line graphs,
showing in particular that, on any class of line graphs, clique-width,
mim-width, sim-width and tree-independence number are all equivalent, and
bounded if and only if the class of root graphs has bounded treewidth. This
extends a result of Gurski and Wanke (2007) stating that a class of graphs
has bounded treewidth if and only if the class of line graphs of
graphs in has bounded clique-width.
We then provide an almost-complete comparison for -free graphs,
leaving one missing case. Our main result is that -free graphs of
bounded mim-width have bounded tree-independence number. This result has
structural and algorithmic consequences. In particular, it proves a special
case of a conjecture of Dallard, Milani\v{c} and \v{S}torgel.
Finally, we consider the question of whether boundedness of a certain width
parameter is preserved under graph powers. We show that the question has a
positive answer for sim-width precisely in the case of odd powers.Comment: 31 pages, 4 figures, abstract shortened due to arXiv requirement
- …