Algorithmic study of d₂-transitivity of graphs

From MaRDI portal

Algorithmic study of $d 2$-transitivity of graphs

Jump to:navigation, search

MaRDI QIDQ6446105zbMATH OpenFDO

Authors S. Paul, Kamal Santra

Publication date 3 August 2023

This page was built for publication: Algorithmic study of $d_2$-transitivity of graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Algorithmic_study_of_$d_2$-transitivity_of_graphs&oldid=95249072"