NDLI: A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F

Content Provider	Springer Nature Link
Author	Balbuena, Cami Guevara, Mucuy kak Galeana Sánchez, Hortensia
Copyright Year	2012
Abstract	A kernel of a directed graph is a set of vertices which is both independent and absorbent. And a digraph is said to be kernel perfect if and only if any induced subdigraph has a kernel. Given a set of arcs F, a semikernel S modulo F is an independent set such that if some Sz-arc is not in F, then there exists a zS-arc. A sufficient condition on the digraph is given in terms of semikernel modulo F in order to guarantee that a digraph is kernel perfect. To do that we give a characterization of kernel perfectness which is a generalization of a previous result given by Neumann-Lara [Seminúcleos de una digráfica. Anales del Instituto de Matemáticas 2, Universidad Nacional Autónoma de México, 1971]. And moreover, we show by means of an example that our result is independent of previous known sufficient conditions.
Ending Page	356
Page Count	8
Starting Page	349
File Format	PDF
ISSN	14398516
e-ISSN	14397617
Journal	Acta Mathematica Sinica, English Series
Issue Number	2
Volume Number	28
Language	English
Publisher	Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Publisher Date	2012-01-15
Publisher Place	Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	kernel-perfect kernel Dominating sets, independent sets, cliques Directed graphs (digraphs), tournaments Mathematics semikernel Digraphs
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph

About $(k,l)$-kernels, semikernels and Grundy functions in partial line digraphs

Richardson’s Theorem in H-coloured Digraphs

H-Kernels in Infinite Digraphs

Distance domination of generalized de Bruijn and Kautz digraphs

A Result on the Small Quasi-Kernel Conjecture

Locating-dominating sets: from graphs to oriented graphs

Secure Domination in Digraphs

An Extension of Richardson’s Theorem in m-Colored Digraphs

A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F

Similar Documents

Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph

About $(k,l)$-kernels, semikernels and Grundy functions in partial line digraphs

Richardson’s Theorem in H-coloured Digraphs

H-Kernels in Infinite Digraphs

Distance domination of generalized de Bruijn and Kautz digraphs

A Result on the Small Quasi-Kernel Conjecture

Locating-dominating sets: from graphs to oriented graphs

Secure Domination in Digraphs

An Extension of Richardson’s Theorem in m-Colored Digraphs

A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F