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:
Razred grafov H(n, k)
Authors:
ID
Flajšman, Nuša
(
Author
)
ID
Taranenko, Andrej
(
Mentor
)
More about this mentor...
ID
Repolusk, Polona
(
Comentor
)
Files:
UN_Flajsman_Nusa_2016.pdf
(1,69 MB)
MD5: B512E3A977509A4B13AA961DCCB8C6F2
Language:
Slovenian
Work type:
Undergraduate thesis
Typology:
2.11 - Undergraduate Thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Naj bosta n in k naravni števili in n≥k. To diplomsko delo predstavlja nov razred grafov H(n,k), ki vsebuje hiperkocke ter Johnsonove in Kneserjeve grafe kot njegove podgrafe. V prvem poglavju so povzeti osnovni pojmi iz teorije grafov, v drugem delu pa bodo predstavljeni nekateri rezultati vezani na družino H(n,k). Na primer, H(n,k) ima maksimalno povezanost (n nad k), H(n,k) je Hamiltonov, če je k liho število ter je sestavljen iz dveh izomorfnih povezanih komponent, če je k sodo število.
Keywords:
teorija grafov
,
hiperkocke
,
hamiltonovi grafi
,
Johnsonovi grafi
,
Kneserjevi grafi
Place of publishing:
Maribor
Publisher:
[N. Flajšman]
Year of publishing:
2016
PID:
20.500.12556/DKUM-60844
UDC:
519.17(043.2)
COBISS.SI-ID:
22569224
NUK URN:
URN:SI:UM:DK:7CVBEMZJ
Publication date in DKUM:
23.09.2016
Views:
1946
Downloads:
111
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
:
FLAJŠMAN, Nuša, 2016,
Razred grafov H(n, k)
[online]. Bachelor’s thesis. Maribor : N. Flajšman. [Accessed 29 August 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=60844
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:
Distance magic labelings of graphs
GRAPH PEGGING NUMBER
Graph theory with applications in games and other real problems
HAMILTONIAN PRISMS
Eulerian and hamiltonian graphs for the primary and secondary school classroom
Similar works from other repositories:
Johnson and Kneser graphs
Book embedding
Hamiltonian cycles in Cayley graphs whose order has few prime factors
Fullerenes
Critical graphs
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:
Class of graphs H(n,k)
Abstract:
Let n and k be positive integers and n≥k. This Graduation Thesis represents a new class of graphs H(n,k), which contains hypercubes, Johnson and Kneser graphs as its subgraphs. The first part summarizes the basic concepts of graph theory, while the second part will present some of the results linked to the family H(n,k). For example, H(n,k) has the maximum connectivity (n choose k), H(n,k) is hamiltonian if k is an odd number, and it consists of two isomorphic connected components if k is even.
Keywords:
graph theory
,
hypercubes
,
hamiltonian graphs
,
Johnson graphs
,
Kneser graphs
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
