IJPAM: Volume 98, No. 4 (2015)



Karnatak University
Dharwad, 580003
Karnataka State, INDIA

Smt. Indira Gandhi College of Engineering
Sector-16, Koparkhairane, Navi Mumbai-400709
Maharashtra State, INDIA
Abstract. I. Anderson (see [#!Ander!#]) asked to study class of graphs with binding number one. We characterize bipartite graphs with binding number one and prove that graphs with binding number one cannot be characterized in terms of forbidden subgraphs by embedding an arbitrary graph in a graph
with binding number one. We obtain bounds on the size of a graph with binding number one. I. Anderson [#!Ander!#] has defined any graph
to be binding minimal if

Received: March 24, 2014
AMS Subject Classification: 05C
Key Words and Phrases: graph, binding number
Download paper from here.
DOI: 10.12732/ijpam.v98i4.1 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2015
Volume: 98
Issue: 4
Pages: 413 - 418
Google Scholar; zbMATH; DOI (International DOI Foundation); WorldCAT.
This work is licensed under the Creative Commons Attribution International License (CC BY).