Melola Discovery

← Melola Discovery

Journal

Bilangan Dominasi-Lokasi pada Graf Hasil Kali Operasi Comb Graf Lintasan dan Graf Siklus

Indonesian Journal of Applied Mathematics · Vol. 2 No. 2 (2023)

DOI
10.35472/indojam.v2i2.1039
ISSN
2774-2016, 2774-2067
Published
2023-01-28
Publisher
Institut Teknologi Sumatra

Abstract

Dominating set of graph G is subset D⊆V(G) which for every vertex v∈V(G)\D those vertices has neighbour in D. If for every pairs of vertice x and y their neighbour set different than we called D locating-dominating set. As for the minimum cardinality of possible dominating set of G is called the locating-dominating number of G. We determine the value of the locating-dominating number for comb product path (Pn) and cycle (Cn) graph.

Collaboration network of the authors

9 authors · 24 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Nela RizkaAffiliation unknown1
Tiara Shofi EdrianiAffiliation unknown1
Dear Michiko Mutiara NoorAffiliation unknown1
Rifky FauziAffiliation unknown1
Yoga AndriyantoAffiliation unknown1
Ciptaning Weargo JatiAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2774-2016/works, first harvested 5 Nov 2026, last seen 8 Nov 2026.
Metadata as oai_dc, converted from Crossref 
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Bilangan Dominasi-Lokasi pada Graf Hasil Kali Operasi Comb Graf Lintasan dan Graf Siklus</dc:title><dc:creator>Pribadi, Aswan Anggun</dc:creator><dc:creator>Dhani, Muhammad</dc:creator><dc:creator>Prestanti, Anastasia Lia Dwi</dc:creator><dc:description>&lt;jats:p&gt;Dominating set of graph G is subset D⊆V(G) which for every vertex v∈V(G)\D those vertices has neighbour in D. If for every pairs of vertice x and y their neighbour set different than we called D locating-dominating set. As for the minimum cardinality of possible dominating set of G is called the locating-dominating number of G. We determine the value of the locating-dominating number for comb product path (Pn) and cycle (Cn) graph.&lt;/jats:p&gt;</dc:description><dc:publisher>Institut Teknologi Sumatra</dc:publisher><dc:date>2023-01-28</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.35472/indojam.v2i2.1039</dc:identifier><dc:identifier>10.35472/indojam.v2i2.1039</dc:identifier><dc:source>Indonesian Journal of Applied Mathematics; Vol 2 No 2 (2023); 74</dc:source><dc:source>2774-2016</dc:source><dc:source>2774-2067</dc:source><dc:relation>https://journal.itera.ac.id/index.php/indojam/article/download/1039/357</dc:relation></oai_dc:dc>