Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Structural properties of CKI-digraphs

Autor
Balbuena, C.; Guevara, M.; Olsen, M.
Tipus d'activitat
Article en revista
Revista
AKCE International Journal of Graphs and Combinatorics
Data de publicació
2014
Volum
11
Número
1
Pàgina inicial
67
Pàgina final
80
URL
http://www.scopus.com/record/display.url?eid=2-s2.0-84901921821&origin=resultslist&sort=plf-f&src=s&st1=%22Structural+properties+of+CKI-digraphs%22&sid=148E88C6FF1B5A48ADAE4837AD3D0063.y7ESLndDIsN8cE7qwvy6w%3a2150&sot=b&sdt=b&sl=54&s=TITLE-ABS-KEY%28%22Structural+properties+of+CKI-digraphs%22%29&relpos=0&relpos=0&citeCnt=0&searchTerm=TITLE-ABS-KEY%28%5C%26quot%3BStructural+properties+of+CKI-digraphs%5C%26quot%3B%29 Obrir en finestra nova
Resum
A kernel of a digraph is a set of vertices which is both independent and absorbant. Let D be a digraph such that every proper induced subdigraph has a kernel. If D has a kernel, then D is kernel perfect, otherwise D is critical kernel-imperfect (for short CKI-digraph). In this work we prove that if a CKI-digraph D is not 2-arc connected, then D - a is kernel perfect for any bridge a of D. If D has no kernel but for all vertex x, D - x has a kernel, then D is called kernel critical. We give condi...
Paraules clau
Circulant digraphs, Critical kernel perfect, Digraphs, Kernel
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants