Three-arc graphs: characterization and domination
From MaRDI portal
Publication:2355755
DOI10.1016/j.dam.2015.04.019zbMath1317.05143arXiv1401.0422OpenAlexW1842471773MaRDI QIDQ2355755
Publication date: 24 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.0422
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- A study of 3-arc graphs
- Hadwiger's conjecture for 3-arc graphs
- On the connectivity and restricted edge-connectivity of 3-arc graphs
- Hamiltonicity of 3-arc graphs
- Diameter and connectivity of 3-arc graphs
- On graphs having domination number half their order
- Finite symmetric graphs with two-arc transitive quotients
- Constructing a class of symmetric graphs
- On the characterization of path graphs
- CROSS RATIO GRAPHS
- Domination in graphs with minimum degree two
- Path graphs
- Domination-balanced graphs
- A class of finite symmetric graphs with 2-arc transitive quotients
- Paths, Stars and the Number Three
- Finite symmetric graphs with two‐arc transitive quotients II
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Three-arc graphs: characterization and domination