论文信息 - Characterizations of Consistent Marked Graphs

Characterizations of Consistent Marked Graphs

A marked graph is a graph with a + or - sign on each vertex and is called consistent if each cycle has an even number of - signs. This concept is motivated by problems of communication networks and social networks. We present some new characterizations and recognition algorithms for consistent marked graphs.

Fred S. Roberts | Shaoji Xu | F. Roberts | Shaoji Xu

[1] Eugene C. Johnsen,et al. The Micro-Macro Connection: Exact Structure and Process , 1989 .

[2] Frank Harary,et al. A simple algorithm to detect balance in signed graphs , 1980, Math. Soc. Sci..

[3] Fred S. Roberts,et al. Applications of Combinatorics and Graph Theory to the Biological and Social Sciences: Seven Fundamental Ideas , 1989 .

[4] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[5] Frank Harary,et al. Enumeration of graphs with signed points and lines , 1977, J. Graph Theory.

[6] Cornelis Hoede. A characterization of consistent marked graphs , 1992, J. Graph Theory.

[7] Shimon Even,et al. Graph Algorithms , 1979 .

[8] Eitan Zemel,et al. Is every cycle basis fundamental? , 1989, J. Graph Theory.

[9] Frank Harary,et al. Consistent graphs with signed points , 1978 .

[10] Frank Harary,et al. Consistency in marked digraphs. , 1978 .

[11] Fred S. Roberts,et al. On the problem of consistent marking of a graph , 1995 .

[12] Frank Harary,et al. Counting balanced signed graphs using marked graphs , 1981 .

[13] Michele Conforti,et al. Structural properties and recognition of restricted and strongly unimodular matrices , 1987, Math. Program..