Advanced search
Publication Cover
Experimental Mathematics Volume 30, 2021 - Issue 3
Submit an article Journal homepage
341
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs

Noga Alona Department of Mathematics, Princeton University, Princeton, NJ, USA;b Schools of Mathematics and Computer Science, Tel Aviv University, Tel Aviv, IsraelView further author information
,
Sebastian M. Cioabăc Department of Mathematical Sciences, University of Delaware, Newark, DE, USACorrespondence[email protected]
View further author information
,
Brandon D. Gilbertc Department of Mathematical Sciences, University of Delaware, Newark, DE, USAView further author information
,
Jack H. Koolend School of Mathematical Sciences, University of Science and Technology of China, Wen-Tsun Wu Key Laboratory of the Chinese Academy of Sciences, Hefei, Anhui, ChinaView further author information
&
Brendan D. McKaye Research School of Computer Science, Australian National University, ACT, AustraliaView further author information
Pages 372-382 | Published online: 09 Jan 2019

References

  • [Alon 97] N. Alon. “Neighborly Families of Boxes and Bipartite Coverings.” In The Mathematics of Paul Erdös, vol. II, edited by R. L. Graham and J. Neśetŕil, pp. 27–31. Berlin: Springer Verlag, 1997.
  • [Alon 17] N. Alon. “Asymptotically Optimal Induced Universal Graphs.” Geom Funct. Anal. 27 (2017), 1–32.
  • [Brouwer et al. 89] A. E. Brouwer, A. Cohen, and A. Neumaier. Distance-Regular Graphs. Berlin: Springer-Verlag, 1989. xviii+495 pp.
  • [Cioabă et al. 17] S. M. Cioabă, R. J. Elzinga, M. Markiewitz, K. Vander Meulen, and T. Vanderwoerd. “Addressing Graph Products and Distance-Regular Graphs.” Disc Appl. Math. 229 (2017), 46–54.
  • [Elzinga et al. 04] R. Elzinga, D. A. Gregory, and K. Vander Meulen. “Addressing the Petersen Graph.” Disc Math. 286 (2004), 241–244.
  • [Fujii and Sawa 08] H. Fujii and M. Sawa. “An Addressing Scheme on Complete Bipartite Graphs.” ARS Combin. 86 (2008), 363–369.
  • [Graham 88] R. L. Graham. Isometric Embeddings of Graphs, Selected Topics in Graph Theory, vol. 3, pp. 133–150. San Diego, CA: Academic Press, 1988.
  • [Graham and Pollak 71] R. L. Graham and H. O. Pollak. On the Addressing Problem for Loop Switching. Bell Syst. Tech. J. 50:8 (1971), 2495–2519.
  • [Gregory and Vander Meulen 96] D.A. Gregory and K. Vander Meulen. “Sharp Bounds for Decompositions of Graphs into Complete r-Partite Subgraphs.” J. Graph Theory 21:4 (1996), 393–400.
  • [Harary et al. 77] F. Harary, D. Hsu, and Z. Miller. “The Biparticity of a Graph.” J. Graph Theory 1:2 (1977), 131–133.
  • [Hoffman 01] A. J. Hoffman. “On a Problem of Zaks.” J. Combin. Theory Ser. A 93 (2001), 271–277.
  • [Kratzke et al. 88] T. Kratzke, B. Reznick, and D. West. “Eigensharp Graphs: Decompositions into Complete Bipartite Subgraphs.” Trans. Amer. Math. Soc. 308 (1988), 637–653.
  • [Sawa 16] M. Sawa. “On a Symmetric Representation of Hermitian Matrices and Its Applications to Graph Theory.” J. Combin. Theory Ser. B 116 (2016), 484–503.
  • [Watanabe et al. 12] S. Watanabe, K. Ishii, and M. Sawa. “A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak.” SIAM J. Disc Math. 26:2 (2012), 527–536.
  • [Winkler 83] P. Winkler. “Proof of the Squashed Cube Conjecture.” Combinatorica 3:1 (1983), 135–139.
  • [Zaks 88] J. Zaks. “Nearly-Neighborly Families of Tetrahedra and the Decomposition of some Multigraphs.” J. Combin. Theory Ser. A 48 (1988), 147–155.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.