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:
Connectivity of Cartesian products of graphs
Authors:
ID
Špacapan, Simon
(Author)
Files:
http://dx.doi.org/10.1016/j.aml.2007.06.010
Language:
English
Work type:
Not categorized
Typology:
1.01 - Original Scientific Article
Organization:
FS - Faculty of Mechanical Engineering
Abstract:
Naj bo
k
a
p
p
a
(
G
)
povezanost grafa
G
in
G
B
o
x
H
kartezični produkt grafov
G
in
H
. Dokažemo, da je za poljubna netrivialna
G
in
H
,
k
a
p
p
a
(
G
B
o
x
H
)
=
m
i
n
k
a
p
p
a
(
G
)
|
H
|
,
k
a
p
p
a
(
H
)
|
G
|
,
d
e
l
t
a
(
G
B
o
x
H
)
.
Keywords:
matematika
,
teorija grafov
,
kartezični produkt grafov
,
povezanost
,
mathematics
,
graph theory
,
Cartesian product
,
connectivity
Year of publishing:
2008
Number of pages:
str. 682-685
Numbering:
Vol. 21, no. 7
PID:
20.500.12556/DKUM-51674
UDC:
519.17
ISSN on article:
0893-9659
COBISS.SI-ID:
14757977
NUK URN:
URN:SI:UM:DK:OHJSAPDP
Publication date in DKUM:
10.07.2015
Views:
1364
Downloads:
77
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
:
ŠPACAPAN, Simon, 2008, Connectivity of Cartesian products of graphs.
Applied Mathematics Letters
[online]. 2008. Vol. 21, no. 7, p. 682–685. [Accessed 21 March 2025]. Retrieved from: http://dx.doi.org/10.1016/j.aml.2007.06.010
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:
The Bologna reform of subject teacher education in the newly founded states in the territory of the former Yugoslavia
Humboldtova reforma šolstva in novohumanizem
Triple helix as a social and legal phenomenon of regional innovative development
Ovire pri učenju revizije - primer bolonjskega univerzitetnega izobraževanja v Sloveniji
Bolonjska reforma in obremenjenost študentov Filozofske fakultete Univerze v Mariboru
Similar works from other repositories:
Bolonjska reforma v visokošolskem izobraževanju
Bolonjska reforma
Guide to reform of higher education
"Novi doktorat" v Avstriji
Spreminjanje ciljev bolonjske reforme in njihovo uveljavljanje v slovenskem visokošolskem prostoru
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:
Applied Mathematics Letters
Shortened title:
Appl. math. lett.
Publisher:
Pergamon
ISSN:
0893-9659
COBISS.SI-ID:
24984320
Secondary language
Language:
Unknown
Title:
Povezanost kartezičnih produktov grafov
Abstract:
Let
k
a
p
p
a
(
G
)
be the connectivity of
G
and
G
B
o
x
H
the Cartesian product of
G
and
H
. We prove that for any nontrivial graphs
G
and
H
,
k
a
p
p
a
(
G
B
o
x
H
)
=
m
i
n
k
a
p
p
a
(
G
)
|
H
|
,
k
a
p
p
a
(
H
)
|
G
|
,
d
e
l
t
a
(
G
B
o
x
H
)
.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back