On Middle Cube Graphs
dc.contributor.author | Dalfó, Cristina | |
dc.contributor.author | Fiol, Miguel Angel | |
dc.contributor.author | Mitjana, Margarida | |
dc.date.accessioned | 2019-02-04T08:21:08Z | |
dc.date.available | 2019-02-04T08:21:08Z | |
dc.date.issued | 2015 | |
dc.identifier.issn | 2338-2287 | |
dc.identifier.uri | http://hdl.handle.net/10459.1/65704 | |
dc.description.abstract | We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors). | ca_ES |
dc.language.iso | eng | ca_ES |
dc.publisher | Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia | ca_ES |
dc.relation.isformatof | Reproducció del document publicat a https://doi.org/10.5614/ejgta.2015.3.2.3 | ca_ES |
dc.relation.ispartof | Electronic Journal of Graph Theory and Applications, vol. 3, núm 2, p. 133-145 | ca_ES |
dc.rights | cc-by-sa (c) C. Dalfo et al., 2015 | ca_ES |
dc.rights.uri | http://creativecommons.org/licenses/by-sa/4.0/ | * |
dc.subject | Distance-regular graph | ca_ES |
dc.subject | Odd graph | ca_ES |
dc.subject | Spectrum | ca_ES |
dc.title | On Middle Cube Graphs | ca_ES |
dc.type | info:eu-repo/semantics/article | ca_ES |
dc.identifier.idgrec | 028094 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | ca_ES |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca_ES |
dc.identifier.doi | https://doi.org/10.5614/ejgta.2015.3.2.3 |