n‐cubes and median graphs

From MaRDI portal
Publication:3863918

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




Related Items (40)

Medians in median graphs and their cube complexes in linear timeThere are no finite partial cubes of girth more than 6 and minimum degree at least 3Restricted fault diameter of hypercube networksTiled partial cubesOn the natural imprint function of a graphClique-gated graphsGeneralized Hamming graphs: some new resultsSpectral determinations and eccentricity matrix of graphsThe median procedure on median graphsUnique eccentric point graphs and their eccentric digraphsHypercube embeddings and Cayley graphs generated by transpositionsOn the spectral radius and the energy of eccentricity matrices of graphsOn the complexity of testing a graph for n-cubeRegular median graphs of linear growthOn super connectivity of Cartesian product graphsTree-like partial Hamming graphsCubic inflation, mirror graphs, regular maps, and partial cubesOn some characterizations of antipodal partial cubesCube-complements of generalized Fibonacci cubesThe median function on median graphs and semilatticesBipartite diametrical graphs of diameter 4 and extreme ordersMedian graphs, parallelism and posetsA new fixed point approach for stable networks and stable marriagesOn geodesic structures of weakly median graphs. I. Decomposition and octahedral graphsTwo-ended regular median graphsYang-Baxter equation in median algebrasA dynamic location problem for graphsOn the Center Sets of Some Graph ClassesOn antipodal and diametrical partial cubesMedian graphs and tree analysis of dichotomous data, an approach to qualitative factor analysisGraph energy based on the eccentricity matrixRecognizing median graphs in subquadratic timeTransitive, locally finite median graphs with finite blocksReconstructing subgraph-counting graph polynomials of increasing families of graphsUnique eccentric point graphsWhat Do Trees and Hypercubes Have in Common?Characterization of 2-arc-transitive partial cubesFrom copair hypergraphs to median graphs with latent verticesOn special classes of self-centred graphsIntersection graphs of maximal hypercubes




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