Pages that link to "Item:Q5636776"
From MaRDI portal
The following pages link to On the Addressing Problem for Loop Switching (Q5636776):
Displayed 50 items.
- A dynamic location problem for graphs (Q583245) (← links)
- On biclique partitions of the complete graph (Q686164) (← links)
- Isometric embedding in products of complete graphs (Q787171) (← links)
- A new proof of a theorem of Graham and Pollak (Q789411) (← links)
- Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices (Q810058) (← links)
- On Euclidean distance matrices (Q884414) (← links)
- Projection of a medium (Q924534) (← links)
- Clique partitions of distance multigraphs (Q932596) (← links)
- On eigensharp and almost eigensharp graphs (Q952068) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- Proof of the squashed cube conjecture (Q1055790) (← links)
- On the addressing problem for directed graphs (Q1068101) (← links)
- Clique partitions of the cocktail party graph (Q1076691) (← links)
- Collapse of the metric hierarchy for bipartite graphs (Q1089359) (← links)
- Node-graceful graphs (Q1104944) (← links)
- Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs (Q1106468) (← links)
- Isometric embeddings in Hamming graphs (Q1110526) (← links)
- On the complexity of testing a graph for n-cube (Q1146982) (← links)
- Sur le cardinal maximum de la base complete d'une fonction booleenne, en fonction du nombre de conjonctions de l'une de ses formes normales (Q1149955) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- On tournament matrices (Q1183197) (← links)
- Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
- On the immersion of digraphs in cubes (Q1214940) (← links)
- On cubical graphs (Q1215634) (← links)
- Embedding finite posets in cubes (Q1219897) (← links)
- On the distance matrix of a tree (Q1226493) (← links)
- Distance matrix polynomials of trees (Q1247981) (← links)
- Decompositions of complete multigraphs related to Hadamard matrices (Q1268621) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- On the natural imprint function of a graph (Q1348742) (← links)
- Covering a graph by complete bipartite graphs (Q1363672) (← links)
- Mixed dominating matrices (Q1377507) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- Decompositions of complete multigraphs derived from Hadamard matrices (Q1399905) (← links)
- Isometric embeddings of subdivided wheels in hypercubes (Q1402086) (← links)
- Inertia and biclique decompositions of joins of graphs (Q1405108) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- Cubic inflation, mirror graphs, regular maps, and partial cubes (Q1422394) (← links)
- On distance matrices and Laplacians (Q1779393) (← links)
- On biclique decompositions of complete \(t\)-partite graphs (Q1805302) (← links)
- Characterizing the flow equivalent trees of a network (Q1811121) (← links)
- Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
- Addressing the Petersen graph (Q1887643) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- A tree whose complement is not eigensharp (Q1971045) (← links)
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations (Q2465831) (← links)
- A \(q\)-analogue of the distance matrix of a tree (Q2496651) (← links)
- Determinant of the distance matrix of a tree with matrix weights (Q2497234) (← links)
- A simple proof of Graham and Pollak's theorem (Q2497973) (← links)