क्यूआर कोड

On classes of neighborhood resolving sets of a graph

<p>Let <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> be a simple connected graph. A subset <span class="math"><em>S</em></span> of <span class="math"><em>V</em></span> is called a neighbourhood set of <span class="math"><em>G</em></span> if <span class="math"><em>G</em> = ⋃<sub><em...

पूर्ण विवरण

में बचाया:
मुख्य लेखकों: B. Sooryanarayana, Suma A. S.
स्वरूप: Artigo
भाषा:Inglês
प्रकाशित: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2018-04-01
श्रृंखला:Electronic Journal of Graph Theory and Applications
विषय:
resolving set, neighbourhood set, neighbourhood resolving sets.
ऑनलाइन पहुंच:http://www.ejgta.org/index.php/ejgta/article/view/249
टैग: टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

समान संसाधन