Hausdorff Graphs
V. Seena & Raji Pilakkat · Journal of Advances in Mathematics and Computer Science · 2015
A simple graph G is said to be Hausdorff if for any two distinct vertices u and v of G, one of the following conditions hold: 1. Both u and v are isolated 2. Either u or v is isolated 3. There exist two non-adjacent edges e1 and e2 of G such that e1 is incident with...
Open access
Research Article
10.9734/BJMCS/2016/20509