Wuhan Polytech Univ, Sch Math & Comp Sci, Wuhan, Hubei, Peoples R China.
语种：
英文
关键词：
graph;edge-chain matrix;multiplication of edge-chain matrix;Eulerianian path;Eulerianian cycle)
期刊：
2019 2ND INTERNATIONAL CONFERENCE ON MECHANICAL ENGINEERING, INDUSTRIAL MATERIALS AND INDUSTRIAL ELECTRONICS (MEIMIE 2019)
年：
2019
页码：
446-451
会议名称：
2019 2nd International Conference on Mechanical Engineering, Industrial Materials and Industrial Electronics (MEIMIE 2019)2019年第二届机械工程、工业材料和工业电子国际会议(Meimie 2019)
会议论文集名称：
2019 2nd International Conference on Mechanical Engineering, Industrial Materials and Industrial Electronics (MEIMIE 2019)2019年第二届机械工程、工业材料和工业电子国际会议(Meimie 2019)论文集
会议时间：
2019-03-29
会议地点：
大连
会议主办单位：
[Gao, Zunhai] Wuhan Polytech Univ, Sch Math & Comp Sci, Wuhan, Hubei, Peoples R China.^[Chen, Zhuo] Wuhan Polytech Univ, Sch Econ & Management, Wuhan, Hubei, Peoples R China.
会议赞助商：
香港信息化与工程国际学会
主编：
Dong, K
出版地：
703 KILMAR CRES, OTTAWA, ONTARIO K2T 0B1, CANADA
出版者：
CLAUSIUS SCIENTIFIC PR INC
ISBN：
978-1-989348-14-7
基金类别：
National Social Science Fund of China [14BGL195]
机构署名：
本校为第一且通讯机构
院系归属：
数学与计算机学院
经济学院
摘要：
The initial edge-chain matrix and general edge-chain matrix of graph are presented. The operations of the general edge-chain matrices are derived, by which a method to find all Eulerian cycles is obtained. Only through some power operations of the initial edge-chain matrix, can reveal all Eulerianian cycles which are showed in the final edge-chain matrix. This method can determine whether Eulerianian cycles exist or not and if they do can also find out all of them. It is effective to directed or undirected finite graph. And it can be simplified by computations of some row vectors and column ve...
