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:
Fair reception and Vizing's conjecture
Authors:
ID
Brešar, Boštjan
(Author)
ID
Rall, Douglas F.
(Author)
Files:
http://dx.doi.org/10.1002/jgt.20366
Language:
English
Work type:
Not categorized
Typology:
1.01 - Original Scientific Article
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Vpeljemo koncept poštenega sprejema grafa, ki je povezan z njegovim dominantnim številom. Dokažemo, da za vse grafe, ki imajo pošten sprejem velikosti njihovega dominantnega števila, velja Vizingova domneva o dominantnem številu kartezičnega produkta grafov, s čimer posplošimo dobro znan rezultat Barcalkina in Germana o razstavljivih grafih. S kombiniranjem nav sega koncepta in rezultata Aharonija, Bergerja in Ziva dobimo alternativen dokaz izreka Aharonija in Szaba, ki pravi, da tetivni grafi zadoščajo Vizingovi domnevi. Predstavimo tudi novo neskončno družino grafov, ki zadoščajo Vizingovi domnevi.
Keywords:
matematika
,
teorija grafov
,
dominacija
,
kartezični produkt grafov
,
Vizingova domneva
,
mathematics
,
graph theory
,
domination
,
Cartesian product of graphs
,
Vizing's conjecture
Year of publishing:
2009
Number of pages:
str. 45-54
Numbering:
Vol. 61, no. 1
PID:
20.500.12556/DKUM-51792
UDC:
519.17
ISSN on article:
0364-9024
COBISS.SI-ID:
15170393
NUK URN:
URN:SI:UM:DK:LROY2X5Y
Publication date in DKUM:
10.07.2015
Views:
1254
Downloads:
115
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 and RALL, Douglas F., 2009, Fair reception and Vizing’s conjecture.
Journal of graph theory
[online]. 2009. Vol. 61, no. 1, p. 45–54. [Accessed 2 April 2025]. Retrieved from: http://dx.doi.org/10.1002/jgt.20366
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
Dominiranje direktnih produktov grafov
Roots of cube polynomials of median graphs
Koreni polinoma kock medianskih grafov
Razlikovalno število kartezičnih produktov polnih grafov
Similar works from other repositories:
Molekularne invariante, porojene iz ekscentričnosti vozlišč
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:
Journal of graph theory
Shortened title:
J. graph theory
Publisher:
J. Wiley & Sons
ISSN:
0364-9024
COBISS.SI-ID:
25747712
Secondary language
Language:
Unknown
Title:
Pošten sprejem in Vizingova domneva
Abstract:
We introduce the concept of fair reception of a graph which is related to its domination number. We prove that all graphs
G
with a fair reception of size
g
a
m
m
a
(
G
)
satisfy Vizing's conjecture on the domination number of Cartesian product graphs, by which we extend the well-known result of Barcalkin and German concerning decomposable graphs. Combining our concept with a result of Aharoni, Berger and Ziv, we obtain an alternative proof of the theorem of Aharoni and Szabó that chordal graphs satisfy Vizing's conjecture. A new infinite family of graphs that satisfy Vizing's conjecture is also presented.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back