View in EDS

The near geodetic number of a graph.

Saved in:
Bibliographic Details
Title: The near geodetic number of a graph.
Authors: Lenin, R.1, Kathiresan, KM.1
Source: Journal of Discrete Mathematical Sciences & Cryptography. Aug2017, Vol. 20 Issue 5, p1091-1100. 10p.
Subjects: Geodesics, Graph theory, Geometric vertices
Abstract: The intervalI(u, v) for any two vertices consists of all those vertices lying on au – v geodesic(shortest path) inG. IfSis a set of vertices ofG,thenI(S) is the union of all setsI(u, v) foru, v∈S.The geodetic numberg(G) is the minimum cardinality among the subsetsSofV(G) withI(S) =V(G). A set S ⊇V(G) is a near geodetic set if for everyvinV(G) –S, there exists somex, yinSwith |I(x,y) ∩N(v)|≥ 2. The near geodetic numbergnear(G) is the minimum cardinality of a near geodetic set inG.In this paper, we proved that ifGis a graph of ordernand clique numberw(G), thengnear(G) ≤n− ω(G) + 2 and this bound is sharp. Further we proved that any positive integersa, bandn, with 2 ≤a
Copyright of Journal of Discrete Mathematical Sciences & Cryptography is the property of Taru Publications and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 126349483
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The near geodetic number of a graph.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Lenin%2C+R%2E%22">Lenin, R.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Kathiresan%2C+KM%2E%22">Kathiresan, KM.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Discrete+Mathematical+Sciences+%26+Cryptography%22">Journal of Discrete Mathematical Sciences & Cryptography</searchLink>. Aug2017, Vol. 20 Issue 5, p1091-1100. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Geodesics%22">Geodesics</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+vertices%22">Geometric vertices</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The intervalI(u, v) for any two vertices consists of all those vertices lying on au – v geodesic(shortest path) inG. IfSis a set of vertices ofG,thenI(S) is the union of all setsI(u, v) foru, v∈S.The geodetic numberg(G) is the minimum cardinality among the subsetsSofV(G) withI(S) =V(G). A set S ⊇V(G) is a near geodetic set if for everyvinV(G) –S, there exists somex, yinSwith |I(x,y) ∩N(v)|≥ 2. The near geodetic numbergnear(G) is the minimum cardinality of a near geodetic set inG.In this paper, we proved that ifGis a graph of ordernand clique numberw(G), thengnear(G) ≤n− ω(G) + 2 and this bound is sharp. Further we proved that any positive integersa, bandn, with 2 ≤a<b≤n− 2, there exists a connected graphGof ordernwithg(G) =aandgnear(G) =b.Also we shown that, for positive integersn,k,lwithn−k−l+ 2 ≥ 0, 2 ≤k<n− 1 and 2 ≤l≤n, there exist a connected graphGof ordernwith clique numberω(G) = 1 andgnear(G) =K. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Discrete Mathematical Sciences & Cryptography is the property of Taru Publications and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=126349483
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/09720529.2016.1248689
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 1091
    Subjects:
      – SubjectFull: Geodesics
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Geometric vertices
        Type: general
    Titles:
      – TitleFull: The near geodetic number of a graph.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Lenin, R.
      – PersonEntity:
          Name:
            NameFull: Kathiresan, KM.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2017
              Type: published
              Y: 2017
          Identifiers:
            – Type: issn-print
              Value: 09720529
          Numbering:
            – Type: volume
              Value: 20
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Journal of Discrete Mathematical Sciences & Cryptography
              Type: main
ResultId 1