ISOMORPHISM OF GRAPHS.

被引:0
|
作者
Rao, A.C. [1 ]
机构
[1] Siddhartha Engineering Coll, Vijayawada, India, Siddhartha Engineering Coll, Vijayawada, India
来源
Journal of the Institution of Engineers (India): Mechanical Engineering Division | 1987年 / 68卷 / pt 1-2期
关键词
INFORMATION THEORY - STATISTICAL METHODS;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Several authors have discussed whether a graph is characterised by the values of its adjacency matrix. It is thought that the characteristic polynomial, ie, determinant of the characteristic matrix obtained from adjacency matrix, should be adequate to detect isomorphism between graphs. However, examples of non-isomorphic graphs whose adjacency matrices have the same characteristic polynomials have been found through computer search. Further, computation of characteristic polynomials for larger graphs is difficult and a computer is needed. In this paper different criteria, concept and computation of which are easy, are proposed to detect isomorphism.
引用
收藏
页码:1 / 4
相关论文
共 50 条
  • [21] Automaticity of ordinals and of homogeneous graphs.
    Delhommé, C
    COMPTES RENDUS MATHEMATIQUE, 2004, 339 (01) : 5 - 10
  • [22] ALGORITHMS ON MARKED DIRECTED GRAPHS.
    Comeau, M.A.
    Thulasiraman, K.
    Canadian electrical engineering journal, 1984, 9 (02): : 72 - 79
  • [23] Cuts in Undirected Graphs. I
    F. Sharifov
    L. Hulianytskyi
    Cybernetics and Systems Analysis, 2020, 56 : 559 - 565
  • [24] Modeling of Systems and Bond Graphs.
    Hussu, Alojz
    Strojniski Vestnik/Journal of Mechanical Engineering, 1986, 32 (1-3): : 1 - 8
  • [25] Cuts in Undirected Graphs. I
    Sharifov, F.
    Hulianytskyi, L.
    Sharifov, F. (fasharifov@gmail.com), 2020, Springer (56) : 559 - 565
  • [26] SURVEY OF THE THEORY OF HYPERCUBE GRAPHS.
    Harary, Frank
    Hayes, John P.
    Wu, Horng-Jyh
    Computers & mathematics with applications, 1986, 15 (04): : 277 - 289
  • [27] The structure of super line graphs.
    Bagga, J
    Ferrero, D
    8TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2005, : 468 - 471
  • [28] Recognizable sets of graphs. A survey
    Courcelle, B.
    Words Languages and Combinatorics - Proceedings, 1992,
  • [29] AUTOMATIC DESIGN WITH DEPENDENCE GRAPHS.
    Casavant, A.E.
    Gajski, D.D.
    Kuck, D.J.
    Jahrbuch der Schiffbautechnischen Gesellschaft, 1980, : 506 - 515
  • [30] DEPTH PROBLEMS FOR FLOW GRAPHS.
    Hirata, Tomio
    Maruoka, Akira
    Kimura, Masayuki
    Systems, computers, controls, 1979, 10 (06): : 78 - 85