Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

DM
1998

favoriteEmaildiscussreport

82views more DM 1998»

Signed analogs of bipartite graphs

13 years 4 months ago

Signed analogs of bipartite graphs

Download www.math.binghamton.edu

We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for significance, and also those edge-signed graphs whose double covering graph is bipartite. If the property of even length is generalized to positivity in a second edge signing, the characterizations generalize as well. We also characterize the edge-signed graphs with the smallest nontrivial chromatic numbers.

Thomas Zaslavsky

Real-time Traffic

DM 1998 | Double Covering Graph | Edge-signed Graphs | Nontrivial Chromatic Numbers |

claim paper

Related Content

» Spectral Analysis of Signed Graphs for Clustering Prediction and Visualization

» A Graph Reduction Approach to Symbolic Circuit Analysis

» Modeling Collaborative Similarity with the Signed Resistance Distance Kernel

» On the Hardness and Easiness of Random 4SAT Formulas

» Balance Support Vector Machines Locally Using the Structural Similarity Kernel

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	DM
Authors	Thomas Zaslavsky

Comments (0)