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 subgraphs of Cartesian product graphs
Authors:
ID
Klavžar, Sandi
(Author)
ID
Lipovec, Alenka
(Author)
ID
Petkovšek, Marko
(Author)
Files:
http://www.imfm.si/preprinti/PDF/00661.pdf
Language:
English
Work type:
Not categorized
Organization:
PEF - Faculty of Education
Abstract:
Karakterizirani so grafi, ki jih lahko predstavimo kot netrivialen podgraf kartezičnega produkta grafov. Kot posledica je pokazano, da ima vsak dvodelni graf z radijem 2, ki ne vsebuje
K
2
,
3
, tako predstavitev. Neskončna družina bazičnih podgrafov je tudi konstruirana - dosedaj je bilo znanih le končno takih grafov.
Keywords:
matematika
,
teorija grafov
,
kartezični produkt grafov
,
podgrafi
,
mathematics
,
graph theory
,
Cartesian product graphs
,
subgraphs
Year of publishing:
1999
Number of pages:
str. 1-9
Numbering:
Vol. 37, št. 661
PID:
20.500.12556/DKUM-49364
ISSN:
1318-4865
UDC:
519.17
COBISS.SI-ID:
8984665
NUK URN:
URN:SI:UM:DK:XZTTJTLB
Publication date in DKUM:
10.07.2015
Views:
1179
Downloads:
83
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
:
KLAVŽAR, Sandi, LIPOVEC, Alenka and PETKOVŠEK, Marko, 1999,
On subgraphs of Cartesian product graphs
[online]. 1999. [Accessed 28 March 2025]. Retrieved from: http://www.imfm.si/preprinti/PDF/00661.pdf
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:
Mulder, Henry Martin: Metric graph theory: the case of median graphs. - Graph connections (Cochin, 1998), 19-32, Allied Publ., New Delhi, 1999
Drevesom podobni izometrični podgrafi hiperkock
Brešar, Boštjan: On the natural imprint function of a graph. - European J. Combin. 23 (2002), no. 2, 149-161
Križni grafi grafov zastraženih inverzov
O geodetskem številu medianskih grafov
Similar works from other repositories:
Infinite median graphs
Kroženje v hiperkockah
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:
Unknown
Title:
O podgrafih kartezičnega produkta grafov
Abstract:
Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite,
K
2
,
3
-free graphs of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
