The number of spanning trees of \(E\)-extended power graphs associated with finite semigroups
DOI10.1016/j.disc.2024.114137zbMATH Open1543.0509MaRDI QIDQ6570052
Xiuyun Guo, Pei Gao, Yanhui Wang
Publication date: 10 July 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) General structure theory for semigroups (20M10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Commutative semigroups (20M14) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite simple groups and their classification (20D05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anisotropic groups of type \(A_n\) and the commuting graph of finite simple groups.
- A theorem on trees.
- A generalization of prime graphs of finite groups
- The zero-divisor graph of a commutative semigroup
- On characterization of a completely simple semigroup by its power graph and Green relations
- Exchange property for resolving sets in power graphs
- Undirected power graphs of semigroups
- Power graphs and semigroups of matrices.
- The power graph of a finite group, II
- The number of spanning trees of power graphs associated with specific groups and some applications
- Elementary Number Theory
- On connectedness of power graphs of finite groups
This page was built for publication: The number of spanning trees of \(E\)-extended power graphs associated with finite semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570052)