Strong isometric dimension, biclique coverings, and Sperner's theorem

Dalibor Fronček; Janja Jerebic; Sandi Klavžar; Petr Kovář

doi:10.1017/S0963548306007711

Strong isometric dimension, biclique coverings, and Sperner's theorem

Dalibor Fronček, Janja Jerebic, Sandi Klavžar, Petr Kovář

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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 K₂□ K_n is determined.

Original language	English (US)
Pages (from-to)	271-275
Number of pages	5
Journal	Combinatorics Probability and Computing
Volume	16
Issue number	2
DOIs	https://doi.org/10.1017/S0963548306007711
State	Published - Mar 2007

Bibliographical note

Funding Information:
† Supported by the University of Minnesota Duluth Grant 177–1009. ‡Supported by the Ministry of Science of Slovenia under the grant Mathematics, Physics and Mechanics, Jadranska 19, 1000 Ljubljana.

Access

10.1017/S0963548306007711

Cite this

@article{9c87b74257b2474db91d03354daad30d,

title = "Strong isometric dimension, biclique coverings, and Sperner's theorem",

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 K2□ Kn is determined.",

author = "Dalibor Fron{\v c}ek and Janja Jerebic and Sandi Klav{\v z}ar and Petr Kov{\'a}{\v r}",

note = "Funding Information: † Supported by the University of Minnesota Duluth Grant 177–1009. ‡Supported by the Ministry of Science of Slovenia under the grant Mathematics, Physics and Mechanics, Jadranska 19, 1000 Ljubljana.",

year = "2007",

month = mar,

doi = "10.1017/S0963548306007711",

language = "English (US)",

volume = "16",

pages = "271--275",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "2",

}

TY - JOUR

T1 - Strong isometric dimension, biclique coverings, and Sperner's theorem

AU - Fronček, Dalibor

AU - Jerebic, Janja

AU - Klavžar, Sandi

AU - Kovář, Petr

N1 - Funding Information: † Supported by the University of Minnesota Duluth Grant 177–1009. ‡Supported by the Ministry of Science of Slovenia under the grant Mathematics, Physics and Mechanics, Jadranska 19, 1000 Ljubljana.

PY - 2007/3

Y1 - 2007/3

N2 - 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 K2□ Kn is determined.

AB - 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 K2□ Kn is determined.

UR - http://www.scopus.com/inward/record.url?scp=33847102663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847102663&partnerID=8YFLogxK

U2 - 10.1017/S0963548306007711

DO - 10.1017/S0963548306007711

M3 - Article

AN - SCOPUS:33847102663

VL - 16

SP - 271

EP - 275

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 2

ER -

Strong isometric dimension, biclique coverings, and Sperner's theorem

Abstract

Bibliographical note

Access

Other files and links

Fingerprint

Cite this