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


Six signed Petersen graphs,and their automorphisms
Authors:Thomas Zaslavsky
Institution:Department of Mathematical Sciences, Binghamton University (SUNY), Binghamton, NY 13902-6000, USA
Abstract:Up to switching isomorphism, there are six ways to put signs on the edges of the Petersen graph. We prove this by computing switching invariants, especially frustration indices and frustration numbers, switching automorphism groups, chromatic numbers, and numbers of proper 1-colorations, thereby illustrating some of the ideas and methods of signed graph theory. We also calculate automorphism groups and clusterability indices, which are not invariant under switching. In the process, we develop new properties of signed graphs, especially of their switching automorphism groups.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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