Boštjan Brešar (Author), Aleksandra Tepeh (Author)

Abstract

Množica vozlišč ▫$S$▫ v grafu se imenuje geodetska množica, če vsako vozlišče tega grafa leži na kaki najkrajši poti med dvema vozliščema iz množice ▫$S$▫. V članku raziskujemo najmanjše geodetske množice medianskih grafov z ozirom na operacijo periferne ekspanzije. Spotoma obravnavamo geodetske množice medianskih prizem in karakteriziramo medianske grafe, ki imajo geodetsko množico velikosti 2.

Keywords

matematika;teorija grafov;medianski grafi;geodetsko število;geodetska množica;kartezični produkt grafov;ekspanzija;mathematics;graph theory;median graphs;geodetic number;geodetic set;Cartesian product;geodesic;expansion;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
UDC: 519.17
COBISS: 14811225 Link will open in a new window
ISSN: 0012-365X
Views: 39
Downloads: 24
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: Slovenian
Secondary title: O geodetskem številu medianskih grafov
Secondary abstract: A set of vertices ▫$S$▫ in a graph is called geodetic if every vertex of this graph lies on some shortest path between two vertices from ▫$S$▫. In this paper, minimum geodetic sets in median graphs are studied with respect to the operation of peripheral expansion. Along the way geodetic sets of median prisms are considered and median graphs that possess a geodetic set of size two are characterized.
Secondary keywords: matematika;teorija grafov;medianski grafi;geodetsko število;geodetska množica;kartezični produkt grafov;ekspanzija;
URN: URN:SI:UM:
Type (COBISS): Not categorized
Pages: str. 4044-4051
Volume: ǂVol. ǂ308
Issue: ǂiss. ǂ18
Chronology: 2008
DOI: 10.1016/j.disc.2007.07.119
ID: 1473677
Recommended works:
, no subtitle data available
, no subtitle data available
, no subtitle data available
, no subtitle data available