Processing math: 100%
Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
For students
For employees
Statistics
Login
First page
>
Show document
Show document
Title:
Povezanost v produktih grafov
Authors:
ID
Cigula, Sandra
(Author)
ID
Špacapan, Simon
(Mentor)
More about this mentor...
Files:
MAG_Cigula_Sandra_2016.pdf
(3,58 MB)
MD5: 9C3D2387F536433C38DD1054C008D232
Language:
Slovenian
Work type:
Master's thesis
Typology:
2.09 - Master's Thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
V tej nalogi bomo obravnavali pojma povezanost po povezavah in povezanost po vozliščih v produktih grafov. Drugi cilj bo opisati strukturo in ostale lastnosti najmanjših presečnih množic vozlišč in najmanjših presečnih množic povezav v produktih grafov. Osredotočili se bomo predvsem na kartezični, direktni, krepki in leksikografski produkt grafov. Zanimalo nas bo, kako izraziti povezanost produkta z lastnostmi posameznih faktorjev produkta, kot so najmanjša stopnja, red grafa in povezanost. Pri direktnem produktu grafov bomo ugotovili, da je povezanost po povezavah odvisna od povezanosti faktorjev, pa tudi od tega, kako daleč sta faktorja
G
in
H
od tega, da bi bila dvodelna. Nato bomo obravnavali velikost in strukturo najmanjših presečnih množic povezav kartezičnih produktov grafov. Podan bo dokaz trditve
l
a
m
b
d
a
(
G
,
B
o
x
,
H
)
=
t
e
x
t
r
m
m
i
n
l
e
f
t
l
a
m
b
d
a
(
G
)
l
e
f
t
|
V
(
H
)
r
i
g
h
t
|
,
l
a
m
b
d
a
(
H
)
l
e
f
t
|
V
(
G
)
r
i
g
h
t
|
,
d
e
l
t
a
(
G
)
+
d
e
l
t
a
(
H
)
r
i
g
h
t
.
Dokaz podobne trditve za povezanost po vozliščih kartezičnega produkta bo naveden v nadaljevanju. Na koncu bomo obravnavali velikost in strukturo najmanjših presečnih množic povezav krepkih produktov grafov in povezanost v leksikografskem produktu.
Keywords:
produkti grafov
,
kartezični produkt
,
direktni produkt
,
krepki produkt
,
leksikografski produkt
,
povezanost.
Place of publishing:
Borovci
Publisher:
[S. Cigula]
Year of publishing:
2016
PID:
20.500.12556/DKUM-58628
UDC:
519.171(043.2)
COBISS.SI-ID:
22455560
NUK URN:
URN:SI:UM:DK:8VEMNVBX
Publication date in DKUM:
23.08.2016
Views:
1681
Downloads:
202
Metadata:
Categories:
FNM
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
:
CIGULA, Sandra, 2016,
Povezanost v produktih grafov
[online]. Master’s thesis. Borovci : S. Cigula. [Accessed 19 March 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=58628
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Primerjava lomne žilavosti TVP, izmerjene pri dveh vrstah majhnih preizkušancev
Lomna žilavost "over-matched" zvarnega spoja, izmerjena na velikih in majhnih preizkušancih
Določitev krhkih področij na fronti razpoke v TVP zvarnega spoja
Vloga in nastanek krhkih mikrostruktur v zvarnih spojih visokotrdnostnih jekel za hidro opremo
Pojav loma v globalno/lokalno trdnostno neenakih zvarnih spojih, izvedenih na visokotrdnostnih jeklih
Similar works from other repositories:
Remote fibre laser welding of advanced high strength martensitic steel
Karakterizacija sočelnih zvarnih spojev na visokotrdnostnem nizkolegiranem jeklu S1100QL varjenih po postopku MAG
Mikrotrdota v zvarnih spojih raznorodnih visokotrdnostnih aluminijevih zlitin
Vpliv ohlajevalne hitrosti na mikrostrukturo jekla GS20Mn5
Vpliv toplotne obdelave na mikrostrukturo zlitine iz sistema Al-Si-Mg-Zr
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Secondary language
Language:
English
Title:
Connectivity of graph products
Abstract:
In this thesis we discuss edge and vertex connectivities of graph products. The aim is to determine the connectivity of all four standard graph products and describe the structure of minimum edge-cut sets. We will study how to express the connectivity of the product with properties of its factors, such as minimum degree, order and connectivity. For the edge connectivity of direct product of graphs we find that connectivity of the product depends not only on connectivities of its factors but also on how far the factors
G
and
H
are from being bipartite. Then we discuss the structure and other properties of minimum edge-cuts in Cartesian product of graphs. We present the proof of the following result
l
a
m
b
d
a
(
G
,
B
o
x
,
H
)
=
t
e
x
t
r
m
m
i
n
l
e
f
t
l
a
m
b
d
a
(
G
)
l
e
f
t
|
V
(
H
)
r
i
g
h
t
|
,
l
a
m
b
d
a
(
H
)
l
e
f
t
|
V
(
G
)
r
i
g
h
t
|
,
d
e
l
t
a
(
G
)
+
d
e
l
t
a
(
H
)
r
i
g
h
t
.
Proof of a similar claim for vertex connectivity of Cartesian products of graphs will also be presented. Finally we consider the size and the structure of minimum edge-cuts in strong products of graphs and edge and vertex connectivities of lexicographic product.
Keywords:
graphs products
,
Cartesian product
,
direct product
,
strong product
,
lexicographic product
,
connectivity.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
