✦ LIBER ✦

A Geometric Construction of Partial Geometries with a Hermitian Point Graph

✍ Scribed by Elisabeth Kuijken

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 73 KB
Volume: 23
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2002.0558

No coin nor oath required. For personal study only.

✦ Synopsis

In 1998 Mathon constructed algebraically a class of partial geometries pg(q -1, (q 2 -1)/2, (q -1)/2), where q is an even power of 3. The point graph of these partial geometries is the Hermitian graph constructed by Taylor. In this paper a geometric construction of Mathon's partial geometries is given. The construction also works if q is an odd power of 3, yielding new partial geometries with a Hermitian point graph.

📜 SIMILAR VOLUMES

Constructing a bipartite graph of maximu

Constructing a bipartite graph of maximum connectivity with prescribed degrees

✍ Asano, Takao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB 👁 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and

Graphs embedded in the plane with a boun

Graphs embedded in the plane with a bounded number of accumulation points

✍ C. Paul Bonnington; R. Bruce Richter 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in

Component-by-Component Construction of G

Component-by-Component Construction of Good Lattice Rules with a Composite Number of Points

✍ Frances Y. Kuo; Stephen Joe 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 272 KB

We develop algorithms to construct rank-1 lattice rules in weighted Korobov spaces of periodic functions and shifted rank-1 lattice rules in weighted Sobolev spaces of non-periodic functions. Analyses are given which show that the rules so constructed achieve strong QMC tractability error bounds. Un

Global minimum geometries of acetylene c

Global minimum geometries of acetylene clusters (HCCH)n with n ≤ 55 obtained by a heuristic method combined with geometrical perturbations

✍ Hiroshi Takeuchi 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 377 KB

## Abstract Geometry optimization of acetylene clusters (HCCH)~__n__~ in the range of __n__ ≤ 55 was carried out with a recently proposed intermolecular potential consisting of Morse potentials, damped dispersion terms, and damped Coulomb terms. The heuristic method developed by the present author

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will

Hydrogen bonding in diols and binary dio

Hydrogen bonding in diols and binary diol–water systems investigated using DFT methods. II. Calculated infrared OH-stretch frequencies, force constants, and NMR chemical shifts correlate with hydrogen bond geometry and electron density topology. A reevaluation of geometrical criteria for hydrogen bonding

✍ Roger A. Klein 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB 👁 1 views

## Abstract Although the two hydroxyl groups in 1,2‐diols interact as evidenced by NMR and IR spectroscopic shifts, electron density topological analysis has shown a bond critical point (BCP) and atomic bond path to be absent (Klein, R. A.; J Comp Chem 2002, 23, 585–599; J Am Chem Soc 2002, 124, 13