首页 | 本学科首页   官方微博 | 高级检索  
     


On a construction of critical graphs which are not sensitive
Authors:K. M. Koh  K. S. Poh
Affiliation:(1) Department of Mathematics, National University of Singapore, 0511 Kent Ridge, Singapore
Abstract:Let ?(G) be theclosed-set lattice of a graphG. G issensitive if the following implication is always true for any graphG′: ?(G)??(G′)?(G)?GG iscritical if ?(G)??(G-e) for anye inE(G) and ?(G)??(G+e) for anye in (left( {bar G} right)) where (bar G) is the complement ofG. Every sensitive graph is, a fortiori, critical. Is every critical graph sensitive? A negative answer to this question is given in this note.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号