<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-science-frontier-research-f-mathematics-decision</journal-id>
<journal-title-group>
<journal-title>Global Journal of Science Frontier Research - F: Mathematics &amp; Decision</journal-title>
</journal-title-group>
<issn publication-format="print">0975-5896</issn>
<issn publication-format="electronic">2249-4626</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/89722.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">89722</article-id>
<title-group>
<article-title>Non Split Geodetic Number of a Line Graph</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>K.S</surname><given-names>Ashalatha</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
<contrib contrib-type="author"><name><surname>Goudar</surname><given-names>Venkanagouda M</given-names></name></contrib>
<contrib contrib-type="author"><name><surname>Venkatesha</surname><given-names></given-names></name></contrib>
</contrib-group>
<aff id="aff1">INDIA, Kuvempu University</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2013-12-23">
<day>23</day>
<month>12</month>
<year>2013</year>
</pub-date>
<volume>13</volume>
<issue>F11</issue>
<fpage>55</fpage>
<lpage>61</lpage>
<abstract><p>A set S V [L(G)] is a non split geodetic set of L(G), if S is a geodetic set and is connected. The non split geodetic number of a line graph L(G), is denoted by g [L(G)], is the minimum cardinality of a non split geodetic set of L(G). In this paper we obtain the non split geodetic number of line graph of any graph. Also obtain many bounds on non split geodetic number in terms of elements of G and covering number of G. We investigate the relationship between non split geodetic number and geodetic number.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>cartesian product</kwd>
<kwd>distance</kwd>
<kwd>edge covering number</kwd>
<kwd>line graph</kwd>
<kwd>non split geodetic number</kwd>
<kwd>vertex covering number.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJSFR_Volume13/4-Non-Split-Geodetic-Number.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/non-split-geodetic-number-of-a-line-graph/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>A set S V [L(G)] is a non split geodetic set of L(G), if S is a geodetic set and is connected. The non split geodetic number of a line graph L(G), is denoted by gns[L(G)], is the minimum cardinality of a non split geodetic set of L(G). In this paper we obtain the non split geodetic number of line graph of any graph. Also obtain many bounds on non split geodetic number in terms of elements of G and covering number of G. We investigate the relationship between non split geodetic number and geodetic number.</p>
</sec>
</body>
</article>