Characterizations of consistent marked graphs

Authors:
Fred S. Roberts;Shaoji Xu
Affiliations:
Department of Mathematics and DIMACS, Rutgers University, 96 Frelinghuysen Road, Piscataway, NJ;AT & T, Middletown, NJ
Venue:
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Year:
2003

Citing 4
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Structural properties and recognition of restricted and strongly unimodular matrices

Mathematical Programming: Series A and B
A characterization of consistent marked graphs

Journal of Graph Theory
Graph Algorithms

Graph Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.