z-logo
open-access-imgOpen Access
Median and quasi-median direct products of graphs
Author(s) -
Boštjan Brešar,
Pranava K. Jha,
Sandi Klavžar,
Blaž Zmazek
Publication year - 2005
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1271
Subject(s) - mathematics , combinatorics
Median graphs are characterized among direct products of graphs on at least three vertices. Beside some trivial cases, it is shown that one component of G × P3 is median if and only if G is a tree in that the distance between any two vertices of degree at least 3 is even. In addition, some partial results considering median graphs of the form G ×K2 are proved, and it is shown that the only nonbipartite quasimedian direct product is K3 ×K3.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom