Cargando…
An Algorithm to detect balancing of iterated line sigraph
A signed graph (or sigraph in short) S is a graph G in which each edge x carries a value [Formula: see text] called its sign denoted specially as [Formula: see text] . Given a sigraph S, H = L(S) called the line sigraph of S is that sigraph in which edges of S are represented as vertices, two o...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2015
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5434767/ https://www.ncbi.nlm.nih.gov/pubmed/28516030 http://dx.doi.org/10.1186/s40064-015-1499-0 |