A Supplement of the Complexity of Graph Isomorphism Test
Luo Shifeng (Coll.of Comp.& Info.Engi.,Guangxi Univ.,Nanning,Guangxi,530004,China)
The vertex with maximum degree and its incidence edges in the graph G are deleted The remaning subgraphs follow in the same way until the last subgraph empty If degrees of the deleted vertexes x\1,x\2,…,x\l are P\1,P\2,…,P\l in order The series P\1,P\2,…,P\l is called the degree series of the graph G The set consists of the degrees of other ends of the incidance edges of x\i(1≤i≤l) in graph G,is called the incidence degree set of x\i The complexity of graph isomorphism test is proved to be polynomial by calculating and comparing the degree series,the degrees of the deleted vertexes and their incidence degree set
【CateGory Index】：
O157.5


Chinese Journal Fulltext Database 
2 Hits



1 
WEN Jianwei,ZHONG Rui (College of Information Management,Chengdu University of Technology,Chengdu Sichuan 610059,China);A New Method for Determining the Isomorphism between Two Graphs[J];Journal of Hebei Polytechnic University(Natural Science Edition);200801 
2 
DAI Qiong~1 ZOU XiaoXiang~2 TAN JianLong~3(Institute of Software, Chinese Academy of Sciences, Beijing 100080)~1(National Computer Network & Information Security Administration Center, Beijing 100029)~2(Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080)~3;Analysis on Complexity of Graph Isomorphism Problem[J];Computer Science;200611 



Chinese Journal Fulltext Database 
10 Hits



1 
Wang ZhirenDepartment of Mathematics and Physics Liu YufengDepartment of Computer and Information Engineering;The Simulative Annealing Algorithm for the Problem of the Maximum Independent Set of Graph[J];;199703 
2 
Zhuo Zhongchang; Liu Yufeng(Dept.of Computer);Research for The Maximum Independent Set Problem of Graph Based on The Principle of Neural Network[J];;199504 
3 
Guo Honggui et al (Navigation Department);Microcomputer Algorithm of Astronomical Fixing and Compass Errors[J];Journal of Dalian Maritime University;198404 
4 
Gu Wei Wu Xunwei ( University of Hangzhou );The Design and Research of the Bipolar Practical Circuit for the Optimal ULG_2[J];Research & Progress of Solid State Electronics;198203 
5 
He Ling Wu Xunwei;Fault Detection in Combinatorial Networks of UniversalLogicGates[J];JOURNAL OF HANGZHOU UNIVERSITY(NATURE SCIENCE);198504 
6 
XU YAPING;CHEN KAIZHOU Department of Mathematics, Hanzhong Teachers College, Hanzhong 723001, PRC Xi'an University of Electronic Science and Technology, Xi'an 710071, PRC;THE NECESSARY AND SUFFICIENT CONDITION OF HGRAPH AND THE OPTIMIZING MODELS OF MINIMUM HCIRCUIT[J];中国科学A辑(英文版);199205 
7 
Hou Luoming;FATAS——An Automated Analysis System for FORTRAN Programs[J];Journal of Computer Research and Development;198604 
8 
Sun Qiang Shen Jianhua Gu Junzhong(Department of Computer Science and Technology,East China Normal University,Shanghai200062);An Improved Algorithm of the Dijkstra Algorithm[J];Computer Engineering and Applications;200203 
9 
SUN QiangSHEN JjanhuaGU Junzhong( Dept. of Computer Science and Technology, East China Normal University, Shanghai 200062);An Efficient Enumerating Algorithm of Generating All Heaps[J];Computer Engineering;200206 
10 
SUN QiangWANG RenwuHUANG Guoxing(Dept. of Computer Science and Technology, East China Normal University, Shanghai 200062);A New Algorithm of the Shortest Path ProblemWith Single Restriction and Multiple Weights[J];Computer Engineering;200208 



Chinese Journal Fulltext Database 
3 Hits



1 
LI Feng 1, LI Xiao yan 2 (1.Department of Electronic Engineering,Fudan University,Shanghai 200433,China; 2.Department of Management Science,Fudan University,Shanghai 200433,China);Isomorphism Testing Algorithm for Graphs:Incidence Degree Sequence Method and Applications[J];Journal of Fudan University;200103 
2 
LIU Guizhen, YU Jiguo & XIE Litong (School of Math. and System Sci., Shandong Univ., Jinan 250100, Shandong, China);Necessary and sufficient conditions of isomorph for two classes of graphs[J];Journal of Shandong University(Natural Science);200303 
3 
LI Feng, SHANG Hui liang (Department of Electronic Engineering, Fudan University, Shanghai200433, China);An Isomorphism Testing Algorithm for Directed Graphs: the Indegree and Outdegree Sequence Method[J];Journal of Applied Sciences;200203 



Chinese Journal Fulltext Database 
2 Hits



1 
JIANG Tao(Department of Computer Science,Bijie University,Bijie,Guizhou ? 551700,China);A Sufficient and Necessary Condition for Regular Graph Isomorphism Identification[J];Journal of Bijie University;201004 
2 
Yang Jijun1 Xu Weisheng2 Wu Qidi2 Wang Guangjing1(1 School of Economics and Management, Tongji University, Shanghai 201804, China)(2 School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China);Nocooperative games for multiple emergency locations in resource scheduling[J];东南大学学报(英文版);2008S1 



China Proceedings of conference Fulltext Database 
1 Hits



