Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Antimedian graphs

From MaRDI portal
Publication:3517166
Jump to:navigation, search

zbMATH Open1201.05029MaRDI QIDQ3517166FDOQ3517166

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

Publication date: 12 August 2008





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


zbMATH Keywords

sum of distanceslinear recognition algorithmantimedian graphsantimedian treesthin even belts


Mathematics Subject Classification ID

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



Cited In (5)

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





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3517166&oldid=16879949"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 23:36. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki