Vol. 2 (10)

THE INTRINSIC PARITY PHASE FACTORS OF REGULAR GRAPHS

17 Downloads 65 Views
Download Full Paper (PDF)

Abstract

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.

Article Analytics

How to Cite This Article

Geetha N. K. (2014); THE INTRINSIC PARITY PHASE FACTORS OF REGULAR GRAPHS, Int. J. of Adv. Res., 2 (10), 0, ISSN 2320-5407.

Corresponding Author

GEETHA.N.K

Creative Commons Attribution 4.0 This work is licensed under a Creative Commons Attribution 4.0 International License.