Subgraph distances in graphs defined by edge transfers
From MaRDI portal
Publication:1363654
DOI10.1016/0012-365X(95)00357-3zbMATH Open0880.05031OpenAlexW2074065661MaRDI QIDQ1363654FDOQ1363654
Gary Chartrand, Elzbieta B. Jarrett, Michelle Schultz, HΓ©ctor Hevia
Publication date: 19 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)00357-3
Cites Work
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Some Theorems on Abstract Graphs
- Edge rotations and distance between graphs
- Title not available (Why is that?)
- Gallai graphs and anti-Gallai graphs
- Convergent sequences of iterated \(H\)-line graphs
- Title not available (Why is that?)
- On distances between isomorphism classes of graphs
- Mortality of iterated Gallai graphs
- Title not available (Why is that?)
- The footballers of Croam
- Graphs whose complement and line graph are isomorphic
- A metric for graphs
- Title not available (Why is that?)
- Rotation and jump distances between graphs
Cited In (18)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on the jump graph of a graph
- A sufficient condition for the jump graph of a graph to be Hamiltonian
- Hamiltonicity of complements of middle graphs
- Title not available (Why is that?)
- On Lict sigraphs
- Integrity of total transformation graphs
- Hamiltonian jump graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination number and feedback vertex number of complements of line graphs
- A note on dominator chromatic number of line graph and jump graph of some graphs
- Super-connected and hyper-connected jump graphs
- Some Cycle and Star Related Nordhaus-Gaddum Type Relations on Strong Effcient Dominating Sets
- Title not available (Why is that?)
- Jump-number of means on graphs
Recommendations
- Title not available (Why is that?) π π
- Distances between graphs under edge operations π π
- Title not available (Why is that?) π π
- On Distance-Transitive Graphs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On distance subgraphs of graphs in spaces of lower dimensions π π
- On subgraphs in distance-regular graphs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: Subgraph distances in graphs defined by edge transfers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363654)