n‐cubes and median graphs

DOI10.1002/JGT.3190040112zbMath0427.05046OpenAlexW2012618961WikidataQ60962156 ScholiaQ60962156MaRDI QIDQ3863918

Henry Martyn Mulder

Publication date: 1980

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190040112

zbMATH Keywords

shortest pathn-cubeconnected regular

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (40)

Medians in median graphs and their cube complexes in linear time ⋮ There are no finite partial cubes of girth more than 6 and minimum degree at least 3 ⋮ Restricted fault diameter of hypercube networks ⋮ Tiled partial cubes ⋮ On the natural imprint function of a graph ⋮ Clique-gated graphs ⋮ Generalized Hamming graphs: some new results ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ The median procedure on median graphs ⋮ Unique eccentric point graphs and their eccentric digraphs ⋮ Hypercube embeddings and Cayley graphs generated by transpositions ⋮ On the spectral radius and the energy of eccentricity matrices of graphs ⋮ On the complexity of testing a graph for n-cube ⋮ Regular median graphs of linear growth ⋮ On super connectivity of Cartesian product graphs ⋮ Tree-like partial Hamming graphs ⋮ Cubic inflation, mirror graphs, regular maps, and partial cubes ⋮ On some characterizations of antipodal partial cubes ⋮ Cube-complements of generalized Fibonacci cubes ⋮ The median function on median graphs and semilattices ⋮ Bipartite diametrical graphs of diameter 4 and extreme orders ⋮ Median graphs, parallelism and posets ⋮ A new fixed point approach for stable networks and stable marriages ⋮ On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs ⋮ Two-ended regular median graphs ⋮ Yang-Baxter equation in median algebras ⋮ A dynamic location problem for graphs ⋮ On the Center Sets of Some Graph Classes ⋮ On antipodal and diametrical partial cubes ⋮ Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis ⋮ Graph energy based on the eccentricity matrix ⋮ Recognizing median graphs in subquadratic time ⋮ Transitive, locally finite median graphs with finite blocks ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs ⋮ Unique eccentric point graphs ⋮ What Do Trees and Hypercubes Have in Common? ⋮ Characterization of 2-arc-transitive partial cubes ⋮ From copair hypergraphs to median graphs with latent vertices ⋮ On special classes of self-centred graphs ⋮ Intersection graphs of maximal hypercubes

This page was built for publication: n‐cubes and median graphs