Title of article
Characterizations of consistent marked graphs Original Research Article
Author/Authors
Fred S. Roberts، نويسنده , , Shaoji Xu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
15
From page
357
To page
371
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.
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885543
Link To Document