Title :
Contractibility for digraphs and the fixed clique property
Author_Institution :
Dept. of Comput. Inf. & Network Eng., Lunghwa Univ. of Sci. & Technol., Taoyuan, Taiwan
Abstract :
Homomorphism graphs are digraphs whose vertices are homomorphisms. A digraph is said to be contractible if the homomorphism graph consisting of vertices the self-mapping homomorphisms of the digraph is connected. In this paper, we show that the notion of contractible digraph extends and unifies various notions of dismantlable structures such as dismantlable graphs and dismantlable posets.
Keywords :
graph theory; digraph contractibility; dismantlable graphs; dismantlable posets; dismantlable structures; fixed clique property; homomorphism graph; self-mapping homomorphisms; Combinatorial mathematics; Computation theory; Conferences; Educational institutions; Games; Geometry; Joining processes;
Conference_Titel :
Awareness Science and Technology and Ubi-Media Computing (iCAST-UMEDIA), 2013 International Joint Conference on
Conference_Location :
Aizuwakamatsu
DOI :
10.1109/ICAwST.2013.6765476