All trees are 1-embeddable and all except stars are 2-embeddable
نویسندگان
چکیده
منابع مشابه
All trees are six-cordial
For any integer k > 0, a tree T is k-cordial if there exists a labeling of the vertices of T by Zk, inducing edge-weights as the sum modulo k of the labels on incident vertices to a given edge, which furthermore satisfies the following conditions: 1. Each label appears on at most one more vertex than any other label. 2. Each edge-weight appears on at most one more edge than any other edge-weigh...
متن کاملFinite groups all of whose proper centralizers are cyclic
A finite group $G$ is called a $CC$-group ($Gin CC$) if the centralizer of each noncentral element of $G$ is cyclic. In this article we determine all finite $CC$-groups.
متن کاملData-Embeddable Texture Synthesis
Data hiding techniques onto images provide tools for protecting copyright or sending secret messages, and they are currently utilized as a simple input device of a cell phone by detecting a data embedded in an image with an equipped digital camera. This paper presents a method of synthesizing texture images for embedding arbitrary data by utilizing the smart techniques of generating repetitive ...
متن کاملOn cyclically embeddable graphs
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.
متن کاملOn cyclically embeddable (n, n-1)-graphs
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider the embeddable (n, n)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90585-h