Dimension of the sum of two copies of a graph
Pavel Křivka (1981)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Estimates for homological dimension of configuration spaces of graphs”
Dimension of the sum of two copies of a graph
A note on dimension of
Svatopluk Poljak, Daniel Turzík (1981)
Czechoslovak Mathematical Journal
Similarity:
Remarks on dimensions of graphs
Vinárek, Jiří
Similarity:
The adjacency graphs of a complex
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
Distance Magic Cartesian Products of Graphs
Sylwia Cichacz, Dalibor Froncek, Elliot Krop, Christopher Raridan (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant. In this paper, we show that hypercubes with dimension divisible by four are not distance magic. We also provide some positive results by proving necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the...
A survey of the algorithmic properties of simplicial, upper bound and middle graphs.
Cheston, Grant A., Jap, Tjoen Seng (2006)
Journal of Graph Algorithms and Applications
Similarity:
The cube polynomial and its derivatives: The case of median graphs.
Brešar, Boštjan, Klavžar, Sandi, Škrekovski, Riste (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: