THE COMPARISON OF BONDAGE NUMBER AND MAXIMUM DEGREE OF AN INTERVAL GRAPH G USING AN ALGORITHM

Authors

  • Dr. A.Sudhakaraiah Asst.Professor, Dept.of Mathematics, S.V. University, Tirupati - A.P-INDIA.
  • R.Joshna priyadharsini Research Scholor, Dept.of Mathematics, S.V. University, Tirupati - A.P-INDIA.

Keywords:

Interval family, Interval Graph, Bondage number, Domination number, Maximum vertex degree.

Abstract

Interval Graphs are rich in combinatorial structures and have found applications in several disciplines such
as Traffic Control, Computer Sciences and particularly useful in cyclic scheduling and computer storage allocation
problems. The bondage number b(G) of a non empty graph G is the minimum cardinality among all sets of edges. In this
paper we present the comparison of bondage number and maximum degree of an interval graph g using an algorithm.

Downloads

Published

2017-05-25

How to Cite

Dr. A.Sudhakaraiah, & R.Joshna priyadharsini. (2017). 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), 4(5), 91–102. Retrieved from https://ijaerd.org/index.php/IJAERD/article/view/4869

Issue

Vol. 4 No. 5 (2017): Volume 4 Issue 5 May 2017

Section

Articles