×

Found 27 Documents (Results 1–27)

Large low-diameter graphs are good expanders. (English) Zbl 1482.05084

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 71, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

A variant of the McKay-Miller-Širáň construction for mixed graphs. (English) Zbl 1356.05072

de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 151-156 (2016).
PDFBibTeX XMLCite
Full Text: DOI Link

Large vertex-transitive and Cayley graphs with given degree and diameter. (English) Zbl 1291.05087

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 365-369 (2007).
MSC:  05C25 05C07 05C12
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Biographic Reference

all top 3

Software