| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652417 | Electronic Notes in Discrete Mathematics | 2009 | 8 Pages |
Abstract
A signed graph (sigraph) S is an ordered pair (G, σ) where G is a graph called the underlying graph of S (denoted by Su) and σ:E(G)→{1,−1}. A signed graph is said to be simple if Su is simple. Given a simple sigraph, we associate a pair of topologies on the vertex set V(S). In this paper, properties of these topologies are determined interms of the properties of the corresponding sigraph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
