论文信息 - On the problem of consistent marking of a graph

On the problem of consistent marking of a graph

Abstract A marked graph is a graph in which each vertex is given a sign + or −. We call such a graph consistent if every cycle has an even number of — signs. Consistent marked graphs arise in the study of communication networks and social networks. We discuss the problem of characterizing graphs that can be consistently marked using at least one — sign, reduce the problem to blocks, and solve it for blocks whose longest cycle has length at most 5.

Fred S. Roberts | F. Roberts

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

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

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

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

[5] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

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

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

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

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

[10] F. Harary. Consistency Theory is Alive and Well , 1983 .