×

Found 224 Documents (Results 1–100)

The diameter of dense random regular graphs. (English) Zbl 1403.05138

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 1934-1944 (2018).
MSC:  05C80 05C12

An entropy-based proof for the Moore bound for irregular graphs. (English) Zbl 1345.05048

Agrawal, Manindra (ed.) et al., Perspectives in computational complexity. The Somenath Biswas anniversary volume. Selected papers based on the presentations at the workshop, Kanpur, India, Summer 2012. Cham: Birkhäuser/Springer (ISBN 978-3-319-05445-2/hbk; 978-3-319-05446-9/ebook). Progress in Computer Science and Applied Logic 26, 173-181 (2014).
MSC:  05C35 05C81

Laplacian matrix of a weighted graph with new pendant vertices. (English) Zbl 1338.05111

Rodríguez Velázques, Juan Alberto (ed.) et al., Extended abstracts of the IX “Jornadas de matemática discreta y algorítmica” (JMDA), Tarragona, Spain, July 7–9, 2014. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 46, 129-136, electronic only (2014).
MSC:  05C22 05C50 05C82
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software