SEMIKERNELS, QUASI KERNELS, AND GRUNDY FUNCTIONS IN THE LINE DIGRAPH

dc.contributor.author	RINCONMEJIA, HA
dc.contributor.author	GALEANASánchez, H
dc.contributor.author	Ramirez, LP
dc.date.accessioned	2011-01-22T10:28:51Z
dc.date.available	2011-01-22T10:28:51Z
dc.date.issued	1991
dc.identifier.issn	0895-4801
dc.identifier.uri	http://hdl.handle.net/11154/3617
dc.description.abstract	It is proved that the number of semikernels (quasi kernels) of a digraph D is less than or equal to the number of semikernels (quasi kernels) of its line digraph L(D). It is also proved that the number of Grundy functions of D is equal to the number of Grundy functions of its line digraph L(D) (in the case where every vertex of D has indegree at least one).	en_US
dc.language.iso	en	en_US
dc.title	SEMIKERNELS, QUASI KERNELS, AND GRUNDY FUNCTIONS IN THE LINE DIGRAPH	en_US
dc.type	Article	en_US
dc.identifier.idprometeo	3491
dc.source.novolpages	4(1):80-83
dc.subject.wos	Mathematics, Applied
dc.description.index	WoS: SCI, SSCI o AHCI
dc.subject.keywords	GRUNDY FUNCTION
dc.subject.keywords	KERNEL
dc.subject.keywords	LINE DIGRAPH
dc.subject.keywords	QUASI KERNEL
dc.subject.keywords	SEMIKERNEL
dc.relation.journal	Siam Journal On Discrete Mathematics