✦ LIBER ✦

A Characterization in Zn of Finite Unit-Distance Graphs in Rn

✍ Scribed by K.B. Chilakamarri

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 173 KB
Volume: 59
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subdividing a Graph Toward a Unit-distan

Subdividing a Graph Toward a Unit-distance Graph in the Plane

✍ Severino V. Gervacio; Hiroshi Maehara 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

The subdivision number of a graph G is defined to be the minimum number of extra vertices inserted into the edges of G to make it isomorphic to a unit-distance graph in the plane. Let t (n) denote the maximum number of edges of a C 4 -free graph on n vertices. It is proved that the subdivision numbe

A Characterization of Affine Dual Frames

A Characterization of Affine Dual Frames in L2(Rn)

✍ Marcin Bownik 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 166 KB

We give a characterization of all (quasi)affine frames in L 2 (R n ) which have a (quasi)affine dual in terms of the two simple equations in the Fourier transform domain. In particular, if the dual frame is the same as the original system, i.e., it is a tight frame, we obtain the well-known characte

Reconstructing the number of copies of a

Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph

✍ A. J. H. King; C. St. J. A. Nash-Williams 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ψ; V(G) Ψ V(H) such that __G__ ‐ ξ ≅ H ‐ Ψ(ξ) for every ξ ∼ __V__(G). Let __J__ be a finite graph and /(π) be a cardinal number for each π ≅ __V__(J). Suppose also that either /(π) is infinite for every π ≅ __V__(J) or _

An Application of a Construction Theory

An Application of a Construction Theory of Strongly Closed Subgraphs in a Distance-regular Graph

✍ A. Hiraki 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 112 KB

## Let be a distance-regular graph with where r ≥ 2 and c r +1 > 1. We prove that r = 2 except for the case a 1 = a r +1 = 0 and c r +1 = 2 by showing the existence of strongly closed subgraphs.

Routing in a Class of Cayley Graphs of S

Routing in a Class of Cayley Graphs of Semidirect Products of Finite Groups

✍ Fen Lin Wu; S. Lakshmivarahan; S.K. Dhall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Recently, Draper initiated the study of interconnection networks based on Cayley graphs of semidirect products of two cyclic groups called supertoroids. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. The Borel graphs introduced by

Synthesis and characterization of a sili

Synthesis and characterization of a silicone resin with silphenylene units in Si-O-Si backbones

✍ Mengqiu Jia; Chaobo Wu; Wei Li; Dahai Gao 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 1 views