Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Maximum number of edges joining vertices on a cube

From MaRDI portal
Publication:1014401
Jump to:navigation, search

DOI10.1016/S0020-0190(03)00257-6zbMath1161.68640OpenAlexW2059130447MaRDI QIDQ1014401

Khaled A. S. Abdel-Ghaffar

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00257-6

zbMATH Keywords

hypercubecombinatorial problemsunit distance code


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items

Sets of binary sequences with small total Hamming distances, THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK, On linear layout of bicube and construction of optimal incomplete bicube, A note about some properties of BC graphs, Vapnik-Chervonenkis density in some theories without the independence property, I, A lower bound on the size of \(k\)-neighborhood in generalized cubes, Embedding algorithm of spined cube into grid structure and its wirelength computation, Maximum induced subgraph of a recursive circulant, Minimum neighborhood in a generalized cube



Cites Work

  • A Survey of Combinatorial Gray Codes
  • On Some Applications of Graph Theory to Geometry
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1014401&oldid=13015215"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki