Endomorphism Spectra of Double-Edge Fan Graphs
نویسندگان
چکیده
There are six classes of endomorphisms for a graph. The sets these form chain under the inclusion sets. In order to systematically study endomorphisms, Böttcher and Knauer defined concepts endomorphism spectrum type graph in 1992. this paper, based on property structure monoids graphs, double-edge fan graphs described. particular, we give spectra types graphs.
منابع مشابه
Endomorphism Spectrums and Endomorphism Types of Graphs
In this paper, the endomorphisms, the half-strong endomorphisms, the locally strong endomorphisms, the quasi-strong endomorphisms, the strong endomorphisms and the automorphisms of a join of cycle n C and a vertex y are investigated. Some enumerative problems concerning these graphs are solved. In particular, the endomorphism spectrums and the endomorphism types of these graphs are given. It ha...
متن کاملSpectra of Edge-Independent Random Graphs
Let G be a random graph on the vertex set {1, 2, . . . , n} such that edges in G are determined by independent random indicator variables, while the probabilities pij for {i, j} being an edge in G are not assumed to be equal. Spectra of the adjacency matrix and the normalized Laplacian matrix of G are recently studied by Oliveira and Chung-Radcliffe. Let A be the adjacency matrix of G, Ā = E(A)...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملEndomorphism Breaking in Graphs
We introduce the endomorphism distinguishing number De(G) of a graph G as the least cardinal d such that G has a vertex coloring with d colors that is only preserved by the trivial endomorphism. This generalizes the notion of the distinguishing number D(G) of a graph G, which is defined for automorphisms instead of endomorphisms. As the number of endomorphisms can vastly exceed the number of au...
متن کاملSuper-edge-graceful labelings of multi-level wheel graphs, fan graphs and actinia graphs
graceful labeling of G. Such sets P and Q are called the vertex values set and edge labels set of G, respectively. The notions of super-edge-graceful graphs and edge-graceful graphs are different. Mitchem and Simoson [6] showed that the step graph C2 6 is super-edge-graceful but not edge-graceful. Shiu [7] showed that the complete graph K4 is edge-graceful but not super-edge-graceful. Mitchem a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11143214