📄 IJAERD-OJS-4869
THE COMPARISON OF BONDAGE NUMBER AND MAXIMUM DEGREE OF AN INTERVAL GRAPH G USING AN ALGORITHM
| Author(s) | : | Dr. A.Sudhakaraiah, R.Joshna priyadharsini |
| Institution | : | Asst.Professor, Dept.of Mathematics, S.V. University, Tirupati - A.P-INDIA. |
| Published In | : | Vol. 4, Issue 5 — May 2017 |
| Page No. | : | 91-102 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Abstract
Interval Graphs are rich in combinatorial structures and have found applications in several disciplines suchas Traffic Control, Computer Sciences and particularly useful in cyclic scheduling and computer storage allocationproblems. The bondage number b(G) of a non empty graph G is the minimum cardinality among all sets of edges. In thispaper we present the comparison of bondage number and maximum degree of an interval graph g using an algorithm.
🕮 How to Cite
Dr. A.Sudhakaraiah, R.Joshna priyadharsini, “THE COMPARISON OF BONDAGE NUMBER AND MAXIMUM DEGREE OF AN INTERVAL GRAPH G USING AN ALGORITHM”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 5, pp. 91-102, May 2017.
Related Papers
Compact Tunable SIW Cavity Resonator Design for Ku-Band Applications
Hassan Al-Kuwari
