On a symmetric representation of Hermitian matrices and its applications to graph theory
DOI10.1016/j.jctb.2015.10.003zbMath1327.05281OpenAlexW2162214170MaRDI QIDQ896012
Publication date: 11 December 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2015.10.003
isometric embeddinggraph decompositionFisher's inequalityGraham-Pollak theoremWitsenhausen's inequality
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Cites Work
- A short note on a short remark of Graham and Lovász
- Isometric embeddings in Hamming graphs
- Biclique decompositions and Hermitian rank
- Distance matrix polynomials of trees
- On biclique decompositions of complete \(t\)-partite graphs
- The existence of two pairwise additive \(\mathrm{BIBD}(v, 2, 1)\) for any \(v\)
- A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak
- Remarks on Hilbert identities, isometric embeddings, and invariant cubature
- On Isometric Embeddings of Graphs
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Combinatorial Designs
- Sharp bounds for decompositions of graphs into completer-partite subgraphs
- On the Addressing Problem for Loop Switching
- A Note on Fisher's Inequality for Balanced Incomplete Block Designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On a symmetric representation of Hermitian matrices and its applications to graph theory
