Edge-determining sets and determining index
From MaRDI portal
Publication:6197637
DOI10.2140/involve.2024.17.85arXiv2207.14122OpenAlexW4392862963MaRDI QIDQ6197637
Publication date: 20 March 2024
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.14122
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Destroying automorphisms by fixing nodes
- Graph derivatives
- A bound for the distinguishing index of regular graphs
- The determining number of a Cartesian product
- A graph which is edge transitive but not arc transitive
- The distinguishing index of connected graphs without pendant edges
- The distinguishing number and the distinguishing index of line and graphoidal graph(s)
- The chromatic distinguishing index of certain graphs
This page was built for publication: Edge-determining sets and determining index