Skip to main content Accessibility help
×
Home
Hostname: page-component-79b67bcb76-vkbph Total loading time: 0.214 Render date: 2021-05-16T00:42:11.129Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true }

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem

Published online by Cambridge University Press:  01 March 2007

DALIBOR FRONČEK
Affiliation:
Department of Mathematics and Statistics, University of Minnesota Duluth, 1117 University Drive, Duluth, MN 55812, USA (e-mail: dfroncek@d.umn.edu)
JANJA JEREBIC
Affiliation:
Department of Mathematics and Computer Science, PeF, University of Maribor, Korošska cesta 160, 2000 Maribor, Slovenia (e-mail: janja.jerebic@uni-mb.si, sandi.klavzar@uni-mb.si)
SANDI KLAVŽAR
Affiliation:
Department of Mathematics and Computer Science, PeF, University of Maribor, Korošska cesta 160, 2000 Maribor, Slovenia (e-mail: janja.jerebic@uni-mb.si, sandi.klavzar@uni-mb.si)
PETR KOVÁŘ
Affiliation:
Department of Mathematics and Descriptive Geometry, Technical University of Ostrava, 17. listopadu 15, 708 33 Ostrava-Poruba, Czech Republic (e-mail: petr.kovar@vsb.cz)

Abstract

The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner's theorem, the strong isometric dimension of the Hamming graphs K2Kn is determined.

Type
Paper
Copyright
Copyright © Cambridge University Press 2006

Access options

Get access to the full version of this content by using one of the access options below.

References

[1]Chung, F. R. K. (1980) On the coverings of graphs. Discrete Math. 30 8993.CrossRefGoogle Scholar
[2]Chung, F. R. K. (1981) On the decomposition of graphs. SIAM J. Algebraic Discrete Methods 2 112.CrossRefGoogle Scholar
[3]Dewdney, A. K. (1980) The embedding dimension of a graph. Ars Combin. 9 7790.Google Scholar
[4]Engel, K. (1997) Sperner Theory, Vol. 65 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge.CrossRefGoogle Scholar
[5]Fitzpatrick, S. L. and Nowakowski, R. J. (2000) The strong isometric dimension of finite reflexive graphs. Discuss. Math. Graph Theory 20 2338.CrossRefGoogle Scholar
[6]Fitzpatrick, S. L. and Nowakowski, R. J. (2001) Copnumber of graphs with strong isometric dimension two. Ars Combin. 59 6573.Google Scholar
[7]Füredi, Z. and Kündgen, A. (2001) Covering a graph with cuts of minimum total size. Discrete Math. 237 129148.CrossRefGoogle Scholar
[8]Imrich, W. and Klavžar, S. (2000) Product Graphs: Structure and Recognition, Wiley, New York.Google Scholar
[9]Isbell, J. R. (1964) Six theorems about injective metric spaces. Comment. Math. Helv. 39 6576.CrossRefGoogle Scholar
[10]Jerebic, J. and Klavžar, S. (2006) On induced and isometric embeddings of graphs into the strong product of paths. Discrete Math. 306 13581363.CrossRefGoogle Scholar
[11]Nešetřil, J. and Rödl, V. (1985) Three remarks on dimensions of graphs. Ann. Discrete Math. 28 199207.Google Scholar
[12]Nowakowski, R. J. and Winkler, P. (1983) Vertex to vertex pursuit in a graph. Discrete Math. 43 235239.CrossRefGoogle Scholar
[13]Poljak, S. and Pultr, A. (1981) Representing graphs by means of strong and weak products. Comment. Math. Univ. Carolin. 22 449466.Google Scholar
[14]Schoenberg, I. J. (1938) Metric spaces and positive definite functions. Trans. Amer. Math. Soc. 44 522536.CrossRefGoogle Scholar
[15]Tomescu, I. (2002) Irreducible coverings by cliques and Sperner's theorem. Electron. J. Combin. 9 #N11, 4 pp.Google Scholar

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *