Contact: +91-9711224068
International Journal of Applied Research
  • Multidisciplinary Journal
  • Printed Journal
  • Indexed Journal
  • Refereed Journal
  • Peer Reviewed Journal

ISSN Print: 2394-7500, ISSN Online: 2394-5869, CODEN: IJARPF


International Journal of Applied Research

Vol. 5, Issue 6, Part A (2019)

Ubat graphs

Joel T Ubat
Koshy (2010) introduced and investigated the concept Complementary Distance Pattern Uniform (CDPU) sets in a connected graph. In this paper, introduces one variety of Complementary Distance Pattern Uniform (CDPU) graphs which is ubat graphs. A graph G is an ubat graph if there exists M ⊂ V (G) such that for any vertex u ∈ V (G)M, there exists a vertex v ∈ M with d(u, v) = e(u), where e(u) denotes eccentricity of u. The set M is called an ubat∗ set of G. An ubat∗ set of G of minimum cardinality is called an ubat set of G. The cardinality of an ubat set of G is called the ubat number of G, denoted by α u(G). A couple of results are generated in this study. Some of which are the following: α(G + H) ≤ min {|V(G)|,|V(H)|} where G and H be connected graphs. Let G be a self-centered graph and H be any graph. Then αu (G+H) = 2. Let K1,n, and Km,n be a star of order n +1 and a complete bipartite graph of order n + m, respectively.
Pages: 24-26  |  522 Views  18 Downloads
download (691KB)
How to cite this article:
Joel T Ubat. Ubat graphs. Int J Appl Res 2019;5(6):24-26.
Call for book chapter
International Journal of Applied Research