Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Browse
New in RUL
About RUL
In numbers
Help
Sign in
Pokrivanja vozlišč grafov z najkrajšimi potmi : magistrsko delo
ID
Iršič, Vesna
(
Author
),
ID
Klavžar, Sandi
(
Mentor
)
More about this mentor...
PDF - Presentation file,
Download
(684,08 KB)
MD5: 02EB8F698ADDCD79872EA4ACF192B0B7
Image galllery
Language:
Slovenian
Keywords:
teorija grafov
,
najkrajše poti
,
izometrična pot
,
geodetsko število
,
število izometričnih poti
Work type:
Master's thesis/paper
Typology:
2.09 - Master's Thesis
Organization:
FMF - Faculty of Mathematics and Physics
Place of publishing:
Ljubljana
Publisher:
[V. Iršič]
Year:
2017
Number of pages:
XI, 57 str.
PID:
20.500.12556/RUL-100863
UDC:
519.17
COBISS.SI-ID:
18122585
Publication date in RUL:
18.04.2018
Views:
2952
Downloads:
376
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
Secondary language
Language:
English
Title:
Covering vertices of graphs with shortest paths
Keywords:
graph theory
,
shortest paths
,
isometric path
,
geodetic number
,
strong geodetic number
,
isometric path number
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back