Nonmedian Direct Products of Graphs with Loops

Details Nonmedian Direct Products of Graphs with Loops Nonmedian Direct Products of Graphs with Loops

2011-02-22

arxiv.org/abs/1102.4634v1

Mathematics

Combinatorics

Accepted to Ars Combinatoria (August 25, 2010)

Scientific paper

A \emph{median graph} is a connected graph in which, for every three vertices, there exists a unique vertex $m$ lying on the geodesic between any two of the given vertices. We show that the only median graphs of the direct product $G\times H$ are formed when $G=P_k$, for any integer $k\geq 3$ and $H=P_l$, for any integer $l\geq 2$, with a loop at an end vertex, where the direct product is taken over all connected graphs $G$ on at least three vertices or at least two vertices with at least one loop, and connected graphs $H$ with at least one loop.

Affiliated with

Also associated with

No associations

Rating

Nonmedian Direct Products of Graphs with Loops does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nonmedian Direct Products of Graphs with Loops, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonmedian Direct Products of Graphs with Loops will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174109