Stability of graph pairs
Autor: | Yan-Li Qin, Binzhou Xia, Jin-Xin Zhou, Sanming Zhou |
---|---|
Rok vydání: | 2021 |
Předmět: |
Coprime integers
010102 general mathematics 0102 computer and information sciences Start up Automorphism 01 natural sciences Graph Theoretical Computer Science Combinatorics Mathematics::Group Theory Computational Theory and Mathematics 010201 computation theory & mathematics Discrete Mathematics and Combinatorics 0101 mathematics Direct product Mathematics |
Zdroj: | Journal of Combinatorial Theory, Series B. 147:71-95 |
ISSN: | 0095-8956 |
DOI: | 10.1016/j.jctb.2020.10.002 |
Popis: | We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs ( Γ , Σ ) is stable if Aut ( Γ × Σ ) ≅ Aut ( Γ ) × Aut ( Σ ) and unstable otherwise, where Γ × Σ is the direct product of Γ and Σ. An unstable graph pair ( Γ , Σ ) is said to be a nontrivially unstable graph pair if Γ and Σ are connected coprime graphs, at least one of them is non-bipartite, and each of them has the property that different vertices have distinct neighborhoods. We obtain necessary conditions for a pair of graphs to be stable. We also give a characterization of a pair of graphs ( Γ , Σ ) to be nontrivially unstable in the case when both graphs are connected and regular with coprime valencies and Σ is vertex-transitive. This characterization is given in terms of the Σ-automorphisms of Γ, which are a new concept introduced in this paper as a generalization of both automorphisms and two-fold automorphisms of a graph. |
Databáze: | OpenAIRE |
Externí odkaz: |