Directionally n-signed graphs-III: The notion of symmetric balance
Let $G=(V, E)$ be a graph. By emph{directional labeling (ord-labeling)} of an edge $x=uv$ of $G$ by an ordered $n$-tuple$(a_1,a_2,...,a_n)$, we mean a labeling of the edge $x$ such thatwe consider the label on $uv$ as $(a_1,a_2,...,a_n)$ in thedirection from $u$ to $v$, and the label on $x$ as$(a_{n...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2013-12-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=3658&_ob=afa2e9837ed9f7e3782ebee733da0db9&fileName=full_text.pdf. |