THE INTRINSIC PARITY PHASE FACTORS OF REGULAR GRAPHS
- Cite This Article as
- Corresponding Author
Let r and k be integers such that 1 ? k < r, and G an m-edge-connected, r-regular graph with v-vertices where m?1. Again it is sharp for infinitely many v and we characterize when equality holds in the bound.
[Geetha N. K. (2014); THE INTRINSIC PARITY PHASE FACTORS OF REGULAR GRAPHS Int. J. of Adv. Res. 2 (10). 0] (ISSN 2320-5407). www.journalijar.com
Share this article
This work is licensed under a Creative Commons Attribution 4.0 International License.