Computation of Gutman index of some cactus chains
<p>Let <span class="math"><em>G</em></span> be a finite connected graph of order <span class="math"><em>n</em></span>. The Gutman index <span class="math"><em>G</em><em>u</em><em>t</em>(<em>G</em>)</span> of <span class="math"><em>G</em></span> is defined as <span class="math">∑<sub>{<em>x</em>, <em...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
| Saila: | Electronic Journal of Graph Theory and Applications |
| Gaiak: | |
| Sarrera elektronikoa: | http://www.ejgta.org/index.php/ejgta/article/view/243 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|