Digraphs that contain at most t distinct walks of a given length with the same endpoints
Crossref DOI link: https://doi.org/10.1007/s10878-021-00718-0
Published Online: 2021-03-04
Published Print: 2021-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lyu, Zhenhua http://orcid.org/0000-0002-6189-164X
Text and Data Mining valid from 2021-03-04
Version of Record valid from 2021-03-04
Article History
Accepted: 22 February 2021
First Online: 4 March 2021