FOCALITY AND GRAPH ISOMORPHISM

被引：0
|
作者：
IMRICH, W [1 ]
SABIDUSSI, G [1 ]
机构：
[1] UNIV MONTREAL,DEPT MATH & STAT,MONTREAL H3C 3J7,QUEBEC,CANADA
来源：
DISCRETE MATHEMATICS | 1990年 / 81卷 / 03期
关键词：
D O I：
10.1016/0012-365X(90)90063-N
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is focal if the stabiliser of every vertex x fixes exactly one edge not incident with x. It is shown that the problem of testing whether a connected bipartite grpah is focal has the same complexity as the graph isomorphism problem. Several other similar questions are also considered. © 1990.
引用
收藏
页码：237 / 245
页数：9
相关论文
共 50 条
  • [1] Isomorphism of the graph
    Wu, Huaan
    DCABES 2007 Proceedings, Vols I and II, 2007, : 1104 - 1106
  • [2] ON GRAPH ISOMORPHISM AND GRAPH AUTOMORPHISM
    ZIVKOVIC, TP
    JOURNAL OF MATHEMATICAL CHEMISTRY, 1991, 8 (1-3) : 19 - 37
  • [3] Reductions to graph isomorphism
    Toran, Jacobo
    FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 158 - 167
  • [4] RANDOM GRAPH ISOMORPHISM
    BABAI, L
    ERDOS, P
    SELKOW, SM
    SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 628 - 635
  • [5] Reductions to Graph Isomorphism
    Jacobo Torán
    Theory of Computing Systems, 2010, 47 : 288 - 299
  • [6] Reductions to Graph Isomorphism
    Toran, Jacobo
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (01) : 288 - 299
  • [7] On graph isomorphism for restricted graph classes
    Koebler, Johannes
    LOGICAL APPROACHES TO COMPUTATIONAL BARRIERS, PROCEEDINGS, 2006, 3988 : 241 - 256
  • [8] Graph fibrations, graph isomorphism, and pagerank
    Boldi, Paolo
    Lonati, Violetta
    Santini, Massimo
    Vigna, Sebastiano
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2006, 40 (02): : 227 - 253
  • [9] On the hardness of graph isomorphism
    Torán, J
    SIAM JOURNAL ON COMPUTING, 2004, 33 (05) : 1093 - 1108
  • [10] Graph isomorphism is in SPP
    Arvind, V.
    Kurur, Piyush P.
    INFORMATION AND COMPUTATION, 2006, 204 (05) : 835 - 852
12345