Smarandache Directionally n-Signed Graphs — A Survey
Main Author: | Reddy, P.Siva Kota |
---|---|
Format: | Article Journal |
Terbitan: |
, 2013
|
Online Access: |
https://zenodo.org/record/9644 |
Daftar Isi:
- For graph theory terminology and notation in this paper we follow the book [3]. All graphs considered here are finite and simple. There are two ways of labeling the edges of a graph by an ordered n-tuple (a1, a2, · · · , an)