On Lict sigraphs
A signed graph (marked graph) is an ordered pair $S=(G,sigma)$ $(S=(G,mu))$, where $G=(V,E)$ is a graph called the underlying graph of $S$ and $sigma:Erightarrow{+,-}$ $(mu:Vrightarrow{+,-})$ is a function. For a graph $G$, $V(G), E(G)$ and $C(G)$ denote its vertex set, edge set and cut-vertex...
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
University of Isfahan
2014-12-01
|
| Serija: | Transactions on Combinatorics |
| Teme: | |
| Online dostop: | http://www.combinatorics.ir/pdf_5627_e7de2aef7c26e21d97bfaf79f2112406.html |
| Oznake: |
Brez oznak, prvi označite!
|