Smarandachely k-Constrained Number of Paths and Cycles
| Main Authors: | Devadas Rao, P. , Sooryanarayana, B., Jayalakshmi, M. |
|---|---|
| Format: | Article |
| Terbitan: |
, 2009
|
| Online Access: |
https://zenodo.org/record/9694 |
Daftar Isi:
- All the graphs considered in this paper are simple, finite and undirected. For standard terminology and notations we refer [1], [3]. There are several types of graph labelings studied by various authors.