Inverse problems of graph theory: graphs without triangles

DOI10.33048/SEMI.2021.18.003zbMATH Open1453.05029OpenAlexW3201618660MaRDI QIDQ2227043

Ivan Nikolaevich Belousov, Dmitriĭ Viktorovich Paduchikh, Alexandre A. Makhnev

Publication date: 9 February 2021

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2021.18.003

zbMATH Keywords

distance regular graphstrongly regular graph without triangles

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Distance-regular Shilla graphs with \(b_2 = c_2\)
• Inverse problems in the theory of distance-regular graphs
• On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
• Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist
• Distance-regular graphs of diameter 3 having eigenvalue \(-1\)

Related Items (2)

Inverse Problems and Zero Forcing for Graphs ⋮ Triangles in inverse NSSD graphs

This page was built for publication: Inverse problems of graph theory: graphs without triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227043)