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:
On Vizing's conjecture
Authors:
ID
Brešar, Boštjan
(Author)
Files:
Discussiones_Mathematicae_Graph_Theory_2001_Bresar_On_Vizing_s_conjecture.pdf
(126,98 KB)
MD5: 286C4062475D3BCDAD7F938289E2AA70
http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1129
Language:
English
Work type:
Scientific work
Typology:
1.01 - Original Scientific Article
Organization:
FKBV - Faculty of Agriculture and Life Sciences
Abstract:
A dominating set
D
gor a graph
G
is a subset
V
(
G
)
such that any vertex in
V
(
G
)
−
D
has a neighbor in
D
, and a domination number
γ
(
G
)
is the size of a minimum dominating set for
G
. For the Cartesian product
G
◻
H
Vizing's conjecture states that
γ
(
G
◻
H
)
≥
γ
(
G
)
γ
(
H
)
for every pair of graphs
G
,
H
. In this paper we introduce a new concept which extends the ordinary domination of graphs, and prove that the conjecture holds when
γ
(
G
)
=
γ
(
H
)
=
3
.
Keywords:
mathematics
,
graph theory
,
graph
,
Cartesian product
,
domination number
Publication status:
Published
Publication version:
Version of Record
Year of publishing:
2001
Number of pages:
str. 5-11
Numbering:
Letn. 21, št. 1
PID:
20.500.12556/DKUM-65351
ISSN:
1234-3099
UDC:
519.17
ISSN on article:
1234-3099
COBISS.SI-ID:
11010137
NUK URN:
URN:SI:UM:DK:PXU92DXH
Publication date in DKUM:
31.03.2017
Views:
1520
Downloads:
123
Metadata:
Categories:
Misc.
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
:
BREŠAR, Boštjan, 2001, On Vizing’s conjecture.
Discussiones mathematicae : Graph theory
[online]. 2001. Vol. 21, no. 1, p. 5–11. [Accessed 8 January 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=65351
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:
Vizing's conjecture: a survey and recent results
Vizing's conjecture: a survey and recent results
Fair reception and Vizing's conjecture
Game chromatic number of Cartesian product graphs
The periphery graph of a median graph
Similar works from other repositories:
Domination number of Hamming graphs
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a journal
Title:
Discussiones mathematicae : Graph theory
Shortened title:
Discuss. Math., Graph Theory
Publisher:
Technical University Press
ISSN:
1234-3099
COBISS.SI-ID:
7487065
Licences
License:
CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:
http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:
The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:
31.03.2017
Secondary language
Language:
Slovenian
Title:
O Vizingovi domnevi
Abstract:
Dominirajoča množica
D
grafa
G
je taka podmnožica množice
V
(
G
)
, za katero ima vsaka točka iz množice
V
(
G
)
−
D
kako sosedo v
D
; dominantno število
γ
(
G
)
pa je velikost najmanjše dominirajoče množice grafa
G
. Za kartezični produkt grafov
G
◻
H
Vizingova domneva trdi, da je
γ
(
G
◻
H
)
≥
γ
(
G
)
γ
(
H
)
, kjer sta
G
in
H
poljubna grafa. V članku vpeljemo nov koncept, ki posploši običajno dominacijo grafov in dokažemo, da domneva drži v promeru, ko je
γ
(
G
)
=
γ
(
H
)
=
3
.
Keywords:
matematika
,
teorija grafov
,
graf
,
kartezični produkt
,
dominantno število
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back