Connected Graphs with Special Automorphism Groups: 10489

1998 ◽  
Vol 105 (3) ◽  
pp. 275
Author(s):  
Frank Schmidt ◽  
R. J. Chapman ◽  
J. H. Lindsey II
Keyword(s):  
Automorphism Groups ◽  
Connected Graphs ◽  
Special Automorphism

scholarly journals Invariance of KMS states on graph C*-algebras under classical and quantum symmetry

2021 ◽  
pp. 1-17
Author(s):  
Soumalya Joardar ◽  
Arnab Mandal
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Inverse Temperature ◽  
Circulant Graphs ◽  
Connected Graphs ◽  
Kms States ◽  
C Algebras ◽  
Kms State ◽  
Quantum Symmetry ◽  
Strongly Connected

Abstract We study the invariance of KMS states on graph $C^{\ast }$ -algebras coming from strongly connected and circulant graphs under the classical and quantum symmetry of the graphs. We show that the unique KMS state for strongly connected graphs is invariant under the quantum automorphism group of the graph. For circulant graphs, it is shown that the action of classical and quantum automorphism groups preserves only one of the KMS states occurring at the critical inverse temperature. We also give an example of a graph $C^{\ast }$ -algebra having more than one KMS state such that all of them are invariant under the action of classical automorphism group of the graph, but there is a unique KMS state which is invariant under the action of quantum automorphism group of the graph.

Ends of graphs

1992 ◽  
Vol 111 (2) ◽  
pp. 255-266 ◽  
Author(s):  
Rgnvaldur G. Mller
Keyword(s):  
Automorphism Groups ◽  
Locally Finite ◽  
Connected Graphs ◽  
Finite Graphs ◽  
Locally Finite Graphs

AbstractIt is shown how questions about ends of locally finite graphs can be reduced to questions about trees. Several applications are given; for example, locally finite connected graphs with infinitely many ends and automorphism groups that act transitively on the ends are classified.

scholarly journals Quantum symmetry of graph C∗-algebras associated with connected graphs

2018 ◽  
Vol 21 (03) ◽  
pp. 1850019 ◽  
Author(s):  
Soumalya Joardar ◽  
Arnab Mandal
Keyword(s):  
Automorphism Group ◽  
Directed Graph ◽  
Automorphism Groups ◽  
Multiple Edge ◽  
Connected Graphs ◽  
C Algebras ◽  
Underlying Graph ◽  
Quantum Symmetry ◽  
Quantum Symmetries ◽  
Funct Anal

We define a notion of quantum automorphism groups of graph [Formula: see text]-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of the underlying directed graph in the sense of Banica [Quantum automorphism groups of homogeneous graphs, J. Funct. Anal. 224 (2005) 243–280] (which is also the symmetry object in the sense of [S. Schmidt and M. Weber, Quantum symmetry of graph [Formula: see text]-algebras, arXiv:1706.08833 ] is shown to be a quantum subgroup of quantum automorphism group in our sense. Quantum symmetries for some concrete graph [Formula: see text]-algebras have been computed.

Pentavalent 1-Transitive Digraphs with Non-Solvable Automorphism Groups

2020 ◽  
Vol 51 (4) ◽  
pp. 1919-1930
Author(s):  
Masoumeh Akbarizadeh ◽  
Mehdi Alaeiyan ◽  
Raffaele Scapellato
Keyword(s):  
Automorphism Groups

scholarly journals The Formula to Count The Number of Vertices Labeled Order Six Connected Graphs with Maximum Thirty Edges without Loops

2021 ◽  
Vol 1751 ◽  
pp. 012023
Author(s):  
F C Puri ◽  
Wamiliana ◽  
M Usman ◽  
Amanto ◽  
M Ansori ◽  
...  
Keyword(s):  
Connected Graphs

scholarly journals On minimum algebraic connectivity of graphs whose complements are bicyclic

2019 ◽  
Vol 17 (1) ◽  
pp. 1490-1502 ◽  
Author(s):  
Jia-Bao Liu ◽  
Muhammad Javaid ◽  
Mohsin Raza ◽  
Naeem Saleem
Keyword(s):  
Connected Graph ◽  
Diffusion Processes ◽  
Laplacian Matrix ◽  
Group Differences ◽  
Algebraic Connectivity ◽  
Connected Graphs ◽  
Bicyclic Graph ◽  
Smallest Eigenvalue ◽  
Unique Graph ◽  
The Stability

Abstract The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model, synchronize the stability, analyze the diffusion processes and find the connectivity of the graphs (networks). A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of vertices plus one. In this paper, firstly the unique graph with a minimum algebraic connectivity is characterized in the class of connected graphs whose complements are bicyclic with exactly three cycles. Then, we find the unique graph of minimum algebraic connectivity in the class of connected graphs $\begin{array}{} {\it\Omega}^c_{n}={\it\Omega}^c_{1,n}\cup{\it\Omega}^c_{2,n}, \end{array}$ where $\begin{array}{} {\it\Omega}^c_{1,n} \end{array}$ and $\begin{array}{} {\it\Omega}^c_{2,n} \end{array}$ are classes of the connected graphs in which the complement of each graph of order n is a bicyclic graph with exactly two and three cycles, respectively.

The Distance Randić Matrix of Connected Graphs

2021 ◽  
Author(s):  
Roberto C. Díaz ◽  
Oscar Rojo
Keyword(s):  
Connected Graphs

scholarly journals Affine cones over cubic surfaces are flexible in codimension one

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Alexander Perepechko
Keyword(s):  
Automorphism Group ◽  
Open Subset ◽  
Pezzo Surface ◽  
Ample Divisor ◽  
Transitive Action ◽  
Del Pezzo Surface ◽  
Codimension One ◽  
Cubic Surfaces ◽  
Special Automorphism ◽  
Del Pezzo

AbstractLet Y be a smooth del Pezzo surface of degree 3 polarized by a very ample divisor that is not proportional to the anticanonical one. Then the affine cone over Y is flexible in codimension one. Equivalently, such a cone has an open subset with an infinitely transitive action of the special automorphism group on it.

scholarly journals Dynamics of epidemic spreading on connected graphs

2021 ◽  
Vol 82 (6) ◽  
Author(s):  
Christophe Besse ◽  
Grégory Faye
Keyword(s):  
Epidemic Spreading ◽  
Connected Graphs
Sign in / Sign up

Export Citation Format

Share Document