AN ALGEBRAIC METHOD FOR FINDING A DUAL GRAPH OF A GIVEN GRAPH

被引：0
|
作者：
VIDYASAGAR, M
机构：
来源：
IEEE TRANSACTIONS ON CIRCUIT THEORY | 1970年 / CT17卷 / 03期
关键词：
D O I：
10.1109/TCT.1970.1083140
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：434 / +
页数：1
相关论文
共 50 条
  • [41] ON LEAST EIGENVALUE OF A GRAPH OF LARGE MINIMUM VALENCE CONTAINING A GIVEN GRAPH
    HOFFMAN, AJ
    SIAM REVIEW, 1968, 10 (02) : 268 - &
  • [42] Method of the Maximum Dynamic Flow Finding in the Fuzzy Graph with Gains
    Kureichik, Victor
    Gerasimenko, Evgeniya
    PROCEEDINGS OF THE THIRD INTERNATIONAL SCIENTIFIC CONFERENCE INTELLIGENT INFORMATION TECHNOLOGIES FOR INDUSTRY (IITI'18), VOL 1, 2019, 874 : 244 - 253
  • [43] An intuitionistic fuzzy graph method for finding the shortest paths in networks
    Karunambigai, M. G.
    Rangasamy, Parvathi
    Atanassov, Krassimir
    Palaniappan, N.
    THEORETICAL ADVANCES AND APPLICATIONS OF FUZZY LOGIC AND SOFT COMPUTING, 2007, 42 : 3 - +
  • [44] On finding the number of graph automorphisms
    Beals, R
    Chang, R
    Gasarch, W
    Torán, J
    CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, 1999, (01): : 1 - 28
  • [45] Finding an even hole in a graph
    Conforti, M
    Cornuejols, G
    Kapoor, A
    Vuskovic, K
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 480 - 485
  • [46] Finding the Spreaders in a Graph Database
    Kader, Riham Abdel
    2019 IEEE 15TH INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTER COMMUNICATION AND PROCESSING (ICCP 2019), 2019, : 335 - 340
  • [47] FINDING MAXIMUM CUT IN A GRAPH
    ORLOVA, GI
    DORFMAN, YG
    ENGINEERING CYBERNETICS, 1972, 10 (03): : 502 - 506
  • [48] FINDING DEPTH OF A FLOW GRAPH
    FONG, AC
    ULLMAN, JD
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1977, 15 (03) : 300 - 309
  • [49] FINDING OF A MINIMAL SKELETON OF A GRAPH
    ROSHCHIN, GB
    ENGINEERING CYBERNETICS, 1978, 16 (01): : 97 - 101
  • [50] ON THE COMPLEXITY OF FINDING A SUN IN A GRAPH
    Hoang, Chinh T.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 23 (04) : 2156 - 2162
12345