Distance-residual subgraphs

DOI10.1016/J.DISC.2009.11.028MaRDI QIDQ973137zbMATH OpenOpenAlexFDO

Authors Primož Lukšič, Tomaž Pisanski

Publication date 28 May 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0609810

zbMATH Keywords

product graphedge-transitive graphvertex-transitive graphsemisymmetric graphdistance degree sequencedistance-residual subgraph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Abstract: If we are given a connected finite graph $G$ and a subset of its vertices $V_0$, we define a distance-residual graph as a graph induced on the set of vertices that have the maximal distance from $V_0$. Some properties and examples of distance-residual graphs of vertex-transitive, edge-transitive, bipartite and semisymmetric graphs are shown. The relations between the distance-residual graphs of product graphs and their factors are shown.

Recommendations

• Publication:3199436
• scientific article; zbMATH DE number 146674
• Residually-Complete Graphs
• Distance-regular subgraphs in a distance-regular graph. III
• Distance-balanced graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3747189 (Why is no real title available?)
• scientific article; zbMATH DE number 1228780 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 871180 (Why is no real title available?)
• scientific article; zbMATH DE number 227006 (Why is no real title available?)
• A census of semisymmetric cubic graphs on up to 768 vertices
• Centers of n-fold tensor products of graphs
• Equitable factorizations of Hamming shells
• Fault-diameter of Cartesian graph bundles
• Genus of cartesian products of regular bipartite graphs
• Highly symmetric subgraphs of hypercubes
• On symmetric subgraphs of the 7-cube: An overview
• On the genus of the tensor product of graphs where one factor is a regular graph
• On the orientable genus of the Cartesian product of a complete regular tripartite graph with an even cycle.
• Recognizing Cartesian graph bundles
• Regular line-symmetric graphs
• Self-dual configurations and regular graphs
• The Categorical Product of Graphs
• The Gray graph revisited
• The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
• The maximum genus of graph bundles
• Yet another look at the Gray graph

Cited in

(3)

• scientific article; zbMATH DE number 5016709 (Why is no real title available?)
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• scientific article; zbMATH DE number 19192 (Why is no real title available?)

This page was built for publication: Distance-residual subgraphs

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