| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Distinguishing infite graphs
Authors:ID Imrich, Wilfried (Author)
ID Klavžar, Sandi (Author)
ID Trofimov, Vladimir Ivanovič (Author)
Files:URL http://www.combinatorics.org/Volume_14/PDF/v14i1r36.pdf
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Razlikovalno število, ▫$D(G)$▫, grafa ▫$G$▫, je najmanjše kardinalno število ▫$aleph$▫, tako da ▫$G$▫ premore označitev z ▫$aleph$▫ oznakami, ki jo ohranja samo trivialni avtomorfizem. Dokažemo, da je razlikovalno število števnega slučajnega grafa enako dva in da imajo drevesom podobni grafi z ne več kot kontinuum vozlišči razlikovalno število enako dva. Določimo tudi razlikovalno število za mnoge razrede neskončnih kartezičnih produktov. Na primer, ▫$D(Q_n) = 2$▫, kjer je ▫$Q_n$▫ neskončna hiperkocka dimenzije ▫$n$▫.
Keywords:matematika, teorija grafov, razlikovalno število, avtomorfizem, neskončni grafi, slučajni graf, kartezični produkt grafov, kardinalna števila, ordinalna števila, mathematics, graph theory, distinguishing number, automorphism, infinite graphs, random graph, Cartesian product of graphs, ordinal numbers, cardinal numbers
Publication status:Published
Publication version:Version of Record
Submitted for review:09.12.2006
Article acceptance date:02.05.2007
Publication date:11.05.2007
Publisher: Electronic Journal of Combinatorics
Year of publishing:2007
Number of pages:Str. 1-12, R36
Numbering:Letn. 14, št. 1
PID:20.500.12556/DKUM-51596 New window
UDC:519.17
ISSN on article:1077-8926
COBISS.SI-ID:14287193 New window
NUK URN:URN:SI:UM:DK:IASLPDQT
Publication date in DKUM:10.07.2015
Views:1423
Downloads:39
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



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:The Electronic journal of combinatorics
Shortened title:Electron. j. comb.
Publisher:N.J. Calkin and H.S. Wilf
ISSN:1077-8926
COBISS.SI-ID:6973785 New window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:05.09.2025

Secondary language

Language:Unknown
Title:Razlikovanje neskončnih grafov
Abstract:The distinguishing number ▫$D(G)$▫ of a graph ▫$G$▫ is the least cardinal number ▫$aleph$▫ such that ▫$G$▫ has a labeling with ▫$aleph$▫ labels that is only preserved by the trivial automorphism. We show that the distinguishing number of the countable random graph is two, that tree-like graphs with not more than continuum many vertices have distinguishing number two, and determine the distinguishing number of many classes of infinite Cartesian products. For instance, ▫$D(Q_n) = 2$▫, where ▫$Q_n$▫ is the infinite hypercube of dimension ▫$n$▫.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica