Digitalni repozitorij raziskovalnih organizacij Slovenije

Izpis gradiva
A+ | A- | Pomoč | SLO | ENG

Naslov:Eccentricity centrality of the comb product between well-knowngraphs and interval graphs : applications in warehouse network optimisation
Avtorji:ID Nandi, Shaoli (Avtor)
ID Mondal, Sukumar (Avtor)
ID Samanta, Sovan (Avtor)
ID Barman, Sambhu Charan (Avtor)
ID Mršić, Leo (Avtor)
ID Kalampakas, Antonios (Avtor)
ID Allahviranloo, Tofigh (Avtor)
Datoteke:URL URL - Izvorni URL, za dostop obiščite https://ojs.wiserpub.com/index.php/CM/article/view/8578/3738
 
.pdf PDF - Predstavitvena datoteka, prenos (2,28 MB)
MD5: 87D2995D654EC19292CAA4F52510616F
 
Jezik:Angleški jezik
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:Logo RUDOLFOVO - Rudolfovo – Znanstveno in tehnološko središče Novo mesto
Povzetek:In network analysis, measuring centrality is essential for determining the relative importance of each vertex with in a network. Avertex with higher centrality signifies greater importance compared to others. To facilitate theoretical studies, networks are commonly modelled using graphs. Deoxyribonucleic Acid (DNA) molecules, some scheduling problems, and food webs have a common linear structure that can be modelled as interval graphs. We explore this matterwithin the framework of calculating vertex eccentricities to ascertain the comparative importance of nodes within thenetwork structure. Eccentricity centrality plays an important role in identifying significant vertices in social networks,facility location networks, etc. In this paper, we compute the eccentricity centrality of the comb product between awell-known graph and an interval graph, and we design twoO(n)time algorithms—one for finding the eccentricity ofall vertices of the interval graph and another for making a Breadth-First Search (BFS) tree of interval graph. We also compute the eccentricity centrality of the comb product between two interval graphs using these algorithms. We also analyse the time complexity of the proposed algorithms. Finally, we present a real application involving in finding acentral warehouse in a warehouse network of an online product-selling company based on our study results.
Ključne besede:eccentricity centrality, comb product of two graphs, interval graphs
Status publikacije:Objavljeno
Verzija publikacije:Objavljena publikacija
Datum objave:26.11.2025
Založnik:Universal Wiser Publisher Pte. Ltd.
Leto izida:2025
Št. strani:str. 8557-8580
Številčenje:Vol. 6, iss. 6
PID:20.500.12556/DiRROS-24571 Novo okno
UDK:51
ISSN pri članku:2705-1056
DOI:10.37256/cm.6620258578 Novo okno
COBISS.SI-ID:260287235 Novo okno
Avtorske pravice:Copyright (c) 2025 Shaoli Nandi, Sukumar Mondal, Sovan Samanta, Sambhu Charan Barman, Leo Mrsic, Antonios Kalampakas, Tofigh Allahviranloo
Opomba:Nasl. z nasl. zaslona; Opis vira z dne 6. 12. 2025; Soavtorji: Sukumar Mondal, Sovan Samanta, Sambhu Charan Barman, Leo Mrsic, Antonios Kalampakas, Tofigh Allahviranloo;
Datum objave v DiRROS:30.12.2025
Število ogledov:466
Število prenosov:87
Metapodatki:XML DC-XML DC-RDF
:
Kopiraj citat
  
Objavi na:Bookmark and Share


Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Contemporary mathematics
Skrajšan naslov:Contemp. math.
Založnik:Universal Wiser Publisher
ISSN:2705-1056
COBISS.SI-ID:182055427 Novo okno

Licence

Licenca:CC BY 4.0, Creative Commons Priznanje avtorstva 4.0 Mednarodna
Povezava:http://creativecommons.org/licenses/by/4.0/deed.sl
Opis:To je standardna licenca Creative Commons, ki daje uporabnikom največ možnosti za nadaljnjo uporabo dela, pri čemer morajo navesti avtorja.

Sekundarni jezik

Jezik:Slovenski jezik
Ključne besede:centralnost ekscentričnosti, glavnikasti produkt dveh grafov, intervalni grafi


Nazaj