Results 221 to 230 of about 74,866 (264)
Some of the next articles are maybe not open access.

Hexagonal Systems, I

2002
In this chapter, we give the classification of hexagonal systems as formulated in Theorem 17.6. Our goal is to show that the list of hexagonal systems described in (15.14) and summarized in Figure 2 on page 148 is complete.
Jacques Tits, Richard M. Weiss
openaire   +1 more source

Wiener Index of Hexagonal Systems

Acta Applicandae Mathematica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dobrynin, Andrey A.   +3 more
openaire   +2 more sources

Perfect matchings in hexagonal systems

Graphs and Combinatorics, 1985
A hexagonal system (HS) is a finite plane graph with no cut-vertices in which every interior region is a hexagonal unit cell. Assume that the vertices of an HS have been colored white and black. We let B(H) and W(H) denote the sets of black and white vertices, respectively, of the hexagonal system H. An edge-cut (EC) of an HS H is a collection of edges
Zhang, F. J., Chen, R. S., Guo, X. F.
openaire   +1 more source

Imaging by a system with a hexagonal pupil

Applied Optics, 2013
We obtain a closed-form analytical expression for the aberration-free point-spread function (PSF) of a system with a hexagonal pupil. The six-fold symmetric PSF consists of a nearly circular bright spot at the center surrounded by a thin dark ring and two each nearly hexagonal bright and dark rings, while maintaining the six-fold symmetry.
José Antonio, Díaz   +1 more
openaire   +2 more sources

A maximal cover of hexagonal systems

Graphs and Combinatorics, 1985
The author proves the following theorem: ''Let H be a peri-condensed HS and K be a cover with maximum cardinality. Then \(H\setminus K\) has a unique 1-factor''. Here is used the following terminology: A hexagonal unit cell is a plane region bounded by a regular hexagon of side length 1. A hexagonal system (HS) is a finite connected plane graph with no
Mao Lin Zheng, Rong-si Chen
openaire   +1 more source

Minimum Covering for Hexagon Triple Systems

Designs, Codes and Cryptography, 2004
The authors have recently obtained a complete solution to the problem of constructing perfect \(k\)-fold hexagon triple systems and perfect maximum packings of \(3k\)-fold \(K_n\) with hexagon systems [Discrete Math. 279, 325--335 (2004; Zbl 1043.05021)].
Selda Küçükçifçi   +1 more
openaire   +1 more source

Perfect matchings in hexagonal systems

Combinatorica, 1984
A hexagonal system (HS) is a finite connected plane graph with no cut- vertices in which every interior region is a hexagonal unit cell. The author provides a simple and fast algorithm for finding a perfect matching (PM) in an HS if it exists. He also characterizes the set of all PM's in a given HS.
openaire   +1 more source

Isomorphic Hexagonal Systems

2002
In Chapter 15, we described six families, or types, of hexagonal systems; they are summarized in Figure 2 on page 148. In Chapter 30, we showed that every hexagonal system belongs to one of these families and in (35.13), we showed that two hexagonal systems give rise to isomorphic Moufang hexagons if and only if they are similar as defined in (29.36 ...
Jacques Tits, Richard M. Weiss
openaire   +1 more source

Design of hexagonal multiplexer for communication system

Proceedings of the International Conference & Workshop on Emerging Trends in Technology, 2011
In this paper, hexagonal loop resonator filter with, without perturbation and tri-band hexagonal multiplexer of high selectively and compact size are presented. The tri-band multiplexer topology is based on the hexagonal loop resonators of different size which capacitive coupled from a single input.
R. Kumar, G. A. Edae
openaire   +1 more source

Hexagonal and rhombohedral systems

1967
Fig. 24 and Tables 5, 6 and 7 provide for calculations and stereographic projections for hexagonal crystals over a wide range of axial ratios.† Rhombohedral lattices referring to these hexagonal axes include the three cubic lattices with the axial ratios given in Table 5. In Fig.
K. W. Andrews, D. J. Dyson, S. R. Keown
openaire   +1 more source

Home - About - Disclaimer - Privacy