Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Computation of Gutman index of some cactus chains

Electronic Journal of Graph Theory and Applications · Vol. 6 No. 1 (2018) · hlm. 138–151

DOI
10.5614/ejgta.2018.6.1.10
ISSN
2338-2287
Terbit
2018-04-03
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

Let G be a finite connected graph of order n. The Gutman index Gut(G) of G is defined as ∑{x, y} ⊆ V(G)deg(x)deg(y)d(x, y), where deg(x) is the degree of vertex x ∈ G and d(x, y) is the distance between vertices x and y in G. A cactus graph is a connected graph in which no edge lies in more than one cycle. In this paper we compute the exact value of Gutman index of some cactus chains.

Kata kunci

Jaringan kolaborasi para penulis

5 penulis · 5 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Somayeh; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran JahariAfiliasi tidak diketahui1
Samaneh; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran SoltaniAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Computation of Gutman index of some cactus chains</dc:title>
	<dc:creator>Sadeghieh, Ali; Department of Mathematics, Islamic Azad University Yazd branch, Yazd, Iran</dc:creator>
	<dc:creator>Ghanbari, Nima; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran.</dc:creator>
	<dc:creator>Alikhani, Saeid; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran.</dc:creator>
	<dc:subject xml:lang="en-US">Gutman index, distance, graph</dc:subject>
	<dc:description xml:lang="en-US">Let G be a finite connected graph of order n. The Gutman index Gut(G) of G is defined as ∑{x, y} ⊆ V(G)deg(x)deg(y)d(x, y), where deg(x) is the degree of vertex x ∈ G and d(x, y) is the distance between vertices x and y in G. A cactus graph is a connected graph in which no edge lies in more than one cycle. In this paper we compute the exact value of Gutman index of some cactus chains.</dc:description>
	<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
	<dc:contributor xml:lang="en-US">Islamic Azad University</dc:contributor>
	<dc:date>2018-04-03</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/243</dc:identifier>
	<dc:identifier>10.5614/ejgta.2018.6.1.10</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 6, No 1 (2018): Electronic Journal of Graph Theory and Applications; 138–151</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/243/pdf_70</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>