Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Determining finite connected graphs along the quadratic embedding constants of paths

Electronic Journal of Graph Theory and Applications · Vol. 9 No. 2 (2021) · hlm. 539–560

DOI
10.5614/ejgta.2021.9.2.23
ISSN
2338-2287
Terbit
2021-10-16
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants of paths Pn form a strictly increasing sequence converging to −1/2. Then we formulate the problem of determining all the graphs G satisfying QEC(Pn)≤QEC(G)<QEC(Pn + 1). The answer is given for n = 2 and n = 3 by exploiting forbidden subgraphs for QEC(G)< − 1/2 and the explicit QE constants of star products of the complete graphs.

Kata kunci

Jaringan kolaborasi para penulis

12 penulis · 17 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
Rinovia; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia SimanjuntakAfiliasi tidak diketahui1
S.; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia SusilawatiAfiliasi tidak diketahui1
Hilda; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia AssiyatunAfiliasi tidak diketahui1
Maya; Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung NabilaAfiliasi tidak diketahui1
Alfi Y.; Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Ganesa 10 Bandung 40132, Indonesia ZakiyyahAfiliasi tidak diketahui1
Chula Janak; Department of Mathematics, University of Colombo, Colombo, Sri Lanka JayawardeneAfiliasi tidak diketahui1
Lilanthi; Department of Mathematics, University of Colombo, Colombo, Sri Lanka SamarasekaraAfiliasi tidak diketahui1
Syafrizal; Universitas Andalas, Padang, Indonesia SyAfiliasi tidak diketahui1
Shariefuddin; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India PirzadaAfiliasi tidak diketahui1
Mushtaq; Department of Mathematics, AAAM Degree College, Bemina, Srinagar, India ShahAfiliasi 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 8 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">Determining finite connected graphs along the quadratic embedding constants of paths</dc:title>
	<dc:creator>Baskoro, Edy Tri; Combinatorial Mathematics Research Group
Faculty of Mathematics and Natural Sciences
Institut Teknologi Bandung
Indonesia</dc:creator>
	<dc:creator>Obata, Nobuaki; Graduate School of Information Sciences
Tohoku University
Sendai 980-8579 Japan</dc:creator>
	<dc:subject xml:lang="en-US">conditionally negative definite matrix; claw-free graphs; distance matrix; quadratic embedding constant; star product graph</dc:subject>
	<dc:subject xml:lang="en-US">05C50; 05C12; 05C76</dc:subject>
	<dc:description xml:lang="en-US">The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants of paths Pn form a strictly increasing sequence converging to −1/2. Then we formulate the problem of determining all the graphs G satisfying QEC(Pn)≤QEC(G)&amp;lt;QEC(Pn + 1). The answer is given for n = 2 and n = 3 by exploiting forbidden subgraphs for QEC(G)&amp;lt; − 1/2 and the explicit QE constants of star products of the complete graphs.</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">JSPS Open Partnership Joint Research Project</dc:contributor>
	<dc:date>2021-10-16</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/1401</dc:identifier>
	<dc:identifier>10.5614/ejgta.2021.9.2.23</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 9, No 2 (2021): Electronic Journal of Graph Theory and Applications; 539 - 560</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/1401/pdf_198</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2021 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>