Pregled bibliografske jedinice broj: 1113282
Edge Realizability of Connected Simple Graphs
Edge Realizability of Connected Simple Graphs // MATCH : communications in mathematical and in computer chemistry, 78 (2017), 3; 689-712 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1113282 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Edge Realizability of Connected Simple Graphs
Autori
Hansen, Piere ; Hertz, Alain ; Sellal, Cherif ; Vukičević, Damir ; Aouchiche, Mustapha ; Caporossi, Gilles
Izvornik
MATCH : communications in mathematical and in computer chemistry (0340-6253) 78
(2017), 3;
689-712
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
edge realizability ; simple graph
(edge realizability, simple graph)
Sažetak
Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbersmijof edges with end-degrees i, j fori≤j∈ {;1, 2, . . . , ∆};, where ∆ is the maximum degree. Moreover this allows to determine the kth-minimum or maximum value of all Adriatic indices together with the corresponding graphs.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Ustanove:
Prirodoslovno-matematički fakultet, Split
Profili:
Damir Vukičević
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
