On minimal embedding of two graphs as center and periphery

1993 ◽  
Vol 9 (2-4) ◽  
pp. 315-323
Author(s):  
Weizhen Gu
Keyword(s):  
Minimal Embedding

scholarly journals Block-Based Steganography Method Using Optimal Selection to Reach High Efficiency and Capacity for Palette Images

2020 ◽  
Vol 10 (21) ◽  
pp. 7820
Author(s):  
Han-Yan Wu ◽  
Ling-Hwei Chen ◽  
Yu-Tai Ching
Keyword(s):  
High Efficiency ◽  
Optimal Selection ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Embedding Efficiency ◽  
Block Based ◽  
Location Map ◽  
Embedding Distortion ◽  
Minimal Embedding

The primary goal of steganographic methods is to develop statically undetectable methods with high steganographic capacity. The embedding efficiency is one kind of measure for undetectability. Block-based steganography methods have been proposed for achieving higher embedding efficiency under limited embedding capacity. However, in these methods, some blocks with larger embedding distortions are skipped, and a location map is usually incorporated into these methods to record the embedding status of each block. This reduces the embedding capacity for secret messages. In this study, we proposed a block-based steganography method without a location map for palette images. In this method, multiple secret bits can be embedded in a block by modifying at most one pixel with minimal embedding distortion; this enables each block to be used for data embedding; thus, our method provides higher embedding capacity. Furthermore, under the same capacity, the estimated and experimental embedding efficiencies of the proposed method are compared with those of Imaizumi et al. and Aryal et al.’s methods; the comparisons indicate that the proposed method has higher embedding efficiency than Imaizumi et al. and Aryal et al.’s methods.

THE ROOT LATTICE D4 AND PLANAR QUASILATTICES WITH OCTAGONAL AND DODECAGONAL SYMMETRY

1991 ◽  
Vol 05 (11) ◽  
pp. 1927-1953 ◽  
Author(s):  
M. BAAKE ◽  
D. JOSEPH ◽  
M. SCHLOTTMANN
Keyword(s):  
Root Lattice ◽  
Dihedral Groups ◽  
Hypercubic Lattice ◽  
Face Centered ◽  
Two Phases ◽  
Minimal Embedding

Quasiperiodic patterns with eight- and twelvefold symmetry are presented which share the root lattice D4, i.e., the 4-D face-centered hypercubic lattice, for their minimal embedding in four-space. We derive the patterns by means of the dualization method and investigate key properties like vertex configurations, local deflation/inflation symmetries and kinematic diffraction. The generalized point symmetries (and thus the Laue group) of these patterns are the dihedral groups d8 and d12, respectively, which share a common subgroup, d4. We introduce a contiunous one-parameter rotation between the two phases which leaves this subgroup invariant. This should prove useful for modelling alloys like V 15 Ni 10 Si where quasicrystalline phases with eight- and twelvefold symmetry coexist.

CLOSED MINIMAL HYPERSURFACES IN COMPACT SYMMETRIC SPACES

1992 ◽  
Vol 03 (05) ◽  
pp. 629-651 ◽  
Author(s):  
CLAUDIO GORODSKI
Keyword(s):  
Symmetric Spaces ◽  
Local Geometry ◽  
Minimal Hypersurfaces ◽  
Compact Symmetric Space ◽  
Orbital Geometry ◽  
Rank One ◽  
Minimal Cones ◽  
Area Minimizing ◽  
Simply Connected ◽  
Minimal Embedding

W.Y. Hsiang, W.T. Hsiang and P. Tomter conjectured that every simply-connected, compact symmetric space of dimension ≥4 must contain some minimal hypersurfaces of sphere type. With the aid of equivariant differential geometry, they showed that this is in fact the case for many symmetric spaces of rank one and two. Let M be one of the symmetric spaces: Sn(1)×Sn(1)(n≥4), SU(6)/Sp(3), E6/F4, ℍP2 (quaternionic proj. plane) or CaP2 (Cayley proj. plane). We prove the existence of infmitely many immersed, minimal hypersurfaces of sphere type in M which are invariant under a certain group G of isometries of M. Following Hsiang and the others, the equivariant method is also used here to reduce the problem to an investigation of geodesics in M/G equipped with a metric (with singularities) depending only on the orbital geometry of the transformation group (G, M). However, our constructions are based on area minimizing homogeneous cones, corresponding to a corner singularity of M/G with the local geometry of nodal type; this can be viewed as a variation of some of their constructions which depended on some unstable minimal cones of focal type. We further apply the equivariant method to construct a minimal embedding of S1×Sn−1×Sn−1 into Sn(1)×Sn(1)(n≥2) and a minimal, embedded hypersurface of sphere type in [Formula: see text], ℍPn×ℍPn (n≥2) and CaP2×CaP2.

Minimal embedding of vector mesons in the low energy effective chiral lagrangian

1992 ◽  
Vol 292 (3-4) ◽  
pp. 377-383 ◽  
Author(s):  
E.A. Kuraev ◽  
Z.K. Silagadze
Keyword(s):  
Low Energy ◽  
Vector Mesons ◽  
Minimal Embedding ◽  
Chiral Lagrangian

scholarly journals Minimal Embedding Dimensions of Rectangle k-Visibility Graphs

2021 ◽  
Vol 25 (1) ◽  
pp. 59-96
Author(s):  
Espen Slettnes
Keyword(s):  
Visibility Graphs ◽  
Minimal Embedding

scholarly journals Minimal embedding dimensions of connected neural codes

2020 ◽  
Vol 11 (1) ◽  
pp. 99-106
Author(s):  
Raffaella Mulas ◽  
Ngoc M. Tran
Keyword(s):  
Neural Codes ◽  
Minimal Embedding

The Genus, Regional Number, and Betti Number of a Graph

1966 ◽  
Vol 18 ◽  
pp. 817-822 ◽  
Author(s):  
Richard A. Duke
Keyword(s):  
Betti Number ◽  
Equality Holding ◽  
Minimal Embedding

Let the genus of an orientable 2-manifold M be denoted by γ(M). The genus, γ(G), of a graph G is then the smallest of the numbers γ(N) for orientable 2-manifolds N in which G can be embedded. An embedding of G in M is called minimal if γ(G) = γ(M). When each component of the complement of G in M is an open 2-cell, the embedding of G in M is called a 2-cell embedding. In (3), J. W. T. Youngs has shown that each minimal embedding is a 2-cell embedding. It follows from the results of (3) that for each graph G, there is a number d(G), called the regional number, such that for any 2-cell embedding of G in an orientable 2-manifold, the number of (2-cell) complementary domains of G is ⩽d(G), with equality holding if and only if the embedding is minimal.

scholarly journals About Structure of Graph Obstructions for Klein Surface with 9 Vertices

2020 ◽  
pp. 65-86
Author(s):  
V.I. Petrenjuk ◽  
D.A. Petrenjuk
Keyword(s):  
Structural Properties ◽  
Graph Structure ◽  
Klein Surface ◽  
Oriented Surface ◽  
Nonorientable Surface ◽  
Nonorientable Surfaces ◽  
Surface Graph ◽  
Genus 2 ◽  
Minimal Embedding ◽  
Structure Graph

The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of j-transformations of the graphs. The problem of establishing the structural properties of 9 vertex obstruction graphs for the surface of the undirected genus 2 by the method of j-transformation of graphs is considered. The article has an introduction and 5 sections. The introduction contains the main definitions, which are illustrated, to some extent, in Section 1, which provides several statements about their properties. Sections 2 – 4 investigate the structural properties of 9 vertex obstruction graphs for an undirected surface by presenting as a j-image of several graphs homeomorphic to one of the Kuratovsky graphs and at least one planar or projective-planar graph. Section 5 contains a new version of the proof of the statement about the peculiarities of the minimal embeddings of finite graphs in nonorientable surfaces, namely, that, in contrast to oriented surfaces, cell boundaries do not contain repeated edges. Also in section 5 the other properties peculiar to embeddings of graphs to non-oriented surfaces and the main result are given. The main result is Theorem 1. Each obstruction graph H for a non-oriented surface N2 of genus 2 satisfies the following. 1. An arbitrary edge u,u = (a,b) is placed on the Mebius strip by some minimal embedding of the graph H in N3 and there exists a locally projective-planar subgraph K of the graph H \ u which satisfies the condition: (tK({a,b},N3)=1)˄(tK\u({a,b},N2)=2), where tK({a,b},N) is the number of reachability of the set {a,b} on the nonorientable surface N; 2. There exists the smallest inclusion of many different subgraphs Ki of a 2-connected graph H homeomorphic to the graph K+e, where K is a locally planar subgraph of the graph H (at least K+e is homemorphic to K5 or K3,3), which covers the set of edges of the graph H. Keywords: graph, Klein surface, graph structure, graph obstruction, non-oriented surface, Möbius strip.

Minimal Embedding of Hypercubic Graphs on Surface

2011 ◽  
pp. 122-129
Author(s):  
Kazuaki Kobayashi ◽  
Takako Kodate
Keyword(s):  
Minimal Embedding
Sign in / Sign up

Export Citation Format

Share Document