Hausdorff Graphs
Journal of Advances in Mathematics and Computer Science · pp. 1–12 · Published 29 Sep 2015
10.9734/BJMCS/2016/20509Abstract
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 u and e2 is incident with v: In this paper we discuss Hausdorff graphs and some examples of it. This paper also deals with the sucient conditions for Kmn, join of two graphs, middle graph of a graph and corona of two graphs to be Hausdorff. The line graph of a given Hausdorff graph is Hausdorff is proved. Moreover, the relations between Hausdorff graph with its incidence matrix and its adjacency matrix are discussed.
Cited by 1
S. M. Bhatwadekar, Jatin Majithia · Communications in Algebra · 2024
Related research
- Generation of Checkered Patterns and Their Variations by Making Use of Eulerian Graph Features — shares topic coverage
- Topologized Bipartite Graph — shares topic coverage
- Incidence Matrix of a Semigraph — shares topic coverage
Article metrics
Real usage data collected on this platform.
8
Page views
0
PDF downloads
0
Outbound clicks
1
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.