The full automorphism groups, determining sets and resolving sets of coprime graphs

DOI10.1007/S00373-019-02014-5MaRDI QIDQ1741589zbMATH OpenOpenAlexWikidataFDO

Authors Junyao Pan, Xiuyun Guo

Publication date 3 May 2019

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-019-02014-5

zbMATH Keywords

coprime graphdetermining setexchange propertyfull automorphism groupsresolving set

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) General theory for finite permutation groups (20B05) Geometric group theory (20F65)

Recommendations

• scientific article; zbMATH DE number 6540713
• scientific article; zbMATH DE number 7249016
• Parameters of the coprime graph of a group
• Binding number for coprime graph of groups
• Classification of groups with toroidal coprime graph

Cites work

• Algebraic Graph Theory
• Automorphisms and distinguishing numbers of geometric cliques
• Base size, metric dimension and other invariants of groups and graphs
• Bases for permutation groups and matroids
• Destroying automorphisms by fixing nodes
• Determining sets, resolving sets, and the exchange property
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• scientific article; zbMATH DE number 3206365 (Why is no real title available?)
• Identifying graph automorphisms using determining sets
• Maximal sets of numbers not containing \(k+1\) pairwise coprimes and having divisors from a specified set of primes
• Maximal sets of numbers not containing k+1 pairwise coprime integers
• On cycles in the coprime graph of integers
• On extremal sets without coprimes
• On the kernel of the coprime graph of integers
• Proof of D. J. Newman's coprime mapping conjecture
• Ramanujan's proof of Bertrand's postulate
• Resolvability in graphs and the metric dimension of a graph
• Sets of integers with pairwise common divisor and a factor from a specified set of primes
• Using determining sets to distinguish Kneser graphs

Cited in

(7)

• Exchange property for resolving sets in power graphs
• Determining number of some families of cubic graphs
• Determining Number of Kneser Graphs: Exact Values and Improved Bounds
• The full automorphism groups of general position graphs
• The automorphism group of nonzero component graph of vector space
• Edge-locating coloring of graphs
• On structural properties and adjacency spectrum of coprime graph of integers

This page was built for publication: The full automorphism groups, determining sets and resolving sets of coprime graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741589)