Antimedian graphs

MaRDI QIDQ3517166zbMATH OpenFDO

Authors Kannan Balakrishnan, Manoj Changat, Sandi Klavžar, Joseph Mathews, Iztok Peterin, G. N. Prasanth, Simon Špacapan

Publication date 12 August 2008

zbMATH Keywords

antimedian graphsantimedian treeslinear recognition algorithmsum of distancesthin even belts

Mathematics Subject Classification ID

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

Recommendations

• Computing median and antimedian sets in median graphs
• On the median and the antimedian of a cograph
• Recognizing pseudo-median graphs
• Axiomatic characterization of the median and antimedian functions on cocktail-party graphs and complete graphs
• Axiomatic characterization of the antimedian function on paths and hypercubes

Cited in

(6)

• Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
• Simultaneous embeddings of graphs as median and antimedian subgraphs
• P-antiregular graphs
• Antistrong digraphs
• On antimode graphs
• On the median and the antimedian of a cograph

This page was built for publication: Antimedian graphs

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