This website requires JavaScript.

A Result on the Small Quasi-Kernel Conjecture

Allan van Hulst
Dec 2022
摘要
Any directed graph $D=(V(D),A(D))$ in this work is assumed to be finite andwithout self-loops. A source in a directed graph is a vertex having at leastone ingoing arc. A quasi-kernel $Q\subseteq V(D)$ is an independent set in $D$such that every vertex in $V(D)$ can be reached in at most two steps from avertex in $Q$. It is an open problem whether every source-free directed graphhas a quasi-kernel of size at most $|V(D)|/2$, a problem known as the smallquasi-kernel conjecture (SQKC). The aim of this paper is to prove the SQKCunder the assumption of a structural property of directed graphs. This relatesthe SQKC to the existence of a vertex $u\in V(D)$ and a bound on the number ofnew sources emerging when $u$ and its out-neighborhood are removed from $D$.The results in this work are of technical nature and therefore additionallyverified by means of the Coq proof-assistant.
展开全部
图表提取

暂无人提供速读十问回答

论文十问由沈向洋博士提出,鼓励大家带着这十个问题去阅读论文,用有用的信息构建认知模型。写出自己的十问回答,还有机会在当前页面展示哦。

Q1论文试图解决什么问题?
Q2这是否是一个新的问题?
Q3这篇文章要验证一个什么科学假设?
0
被引用
笔记
问答