U ovom radu predstavljamo specijalne vrhove povezanoga grafa koji se nazivaju graničnim vrhovima. Navodimo njihova osnovna svojstva, a potom definiramo i karakteriziramo granične pografove povezanog grafa te uspostavljamo odnose između graničnih, ekscentričnih i perifernih podgrafova oslanjajući se na već poznata svojstva ekscentričnih i perifernih grafova. Navodimo nekoliko primjera grafova u kojima granični, ekscentrični i periferni podgrafovi imaju jednak broj vrhova. Rad zaključujemo tvrdnjama o egzistenciji povezanih grafova čiji spomenuti specijalni podgrafovi imaju unaprijed zadane brojeve vrhova, fiksne ili ovisne o broju vrhova zadanog grafa.In this thesis we present special vertices of a connected graph called boundary vertices. W...
Given a graph G and a vertex x ∈ V (G), a vertex set S ⊆ V (G) is an x-geodominating set of G if eac...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
Periferna transverzala medianskega grafa ▫$G$▫ je vpeljana kot množica vozlišč, ki zadane vse perife...
U ovom radu predstavljamo specijalne vrhove povezanoga grafa koji se nazivaju graničnim vrhovima. Na...
V diplomskem delu raziskujemo različne tipe robnih vozlišč: periferna, konturna in ekscentrična vozl...
V magistrskem delu so obravnavane lastnosti in povezave med posameznimi robnimi množicami grafa, ki ...
AbstractThe distance d(u,v) between two vertices u and v in a nontrivial connected graph G is the le...
AbstractFor a pair of vertices x and y in a graph G, we denote by dG(x,y) the distance between x and...
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vert...
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show...
AbstractA vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that ...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
AbstractA vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distan...
V diplomskem delu je obravnavano povezano dominantno število grafa. Na začetku so podrobneje razlože...
V magistrskem delu predstavimo osnove teorije grafov, razpone grafa, z njimi povezane pojme in rezul...
Given a graph G and a vertex x ∈ V (G), a vertex set S ⊆ V (G) is an x-geodominating set of G if eac...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
Periferna transverzala medianskega grafa ▫$G$▫ je vpeljana kot množica vozlišč, ki zadane vse perife...
U ovom radu predstavljamo specijalne vrhove povezanoga grafa koji se nazivaju graničnim vrhovima. Na...
V diplomskem delu raziskujemo različne tipe robnih vozlišč: periferna, konturna in ekscentrična vozl...
V magistrskem delu so obravnavane lastnosti in povezave med posameznimi robnimi množicami grafa, ki ...
AbstractThe distance d(u,v) between two vertices u and v in a nontrivial connected graph G is the le...
AbstractFor a pair of vertices x and y in a graph G, we denote by dG(x,y) the distance between x and...
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vert...
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show...
AbstractA vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that ...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
AbstractA vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distan...
V diplomskem delu je obravnavano povezano dominantno število grafa. Na začetku so podrobneje razlože...
V magistrskem delu predstavimo osnove teorije grafov, razpone grafa, z njimi povezane pojme in rezul...
Given a graph G and a vertex x ∈ V (G), a vertex set S ⊆ V (G) is an x-geodominating set of G if eac...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
Periferna transverzala medianskega grafa ▫$G$▫ je vpeljana kot množica vozlišč, ki zadane vse perife...