Counting the minimum number of arcs in an oriented graph having weak diameter 2

MLA

Das, Sandip, et al. Counting the Minimum Number of Arcs in an Oriented Graph Having Weak Diameter 2. 2023. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2304.00742&authtype=sso&custid=ns315887.

APA

Das, S., Dey, K. K., D, P. P., & Sen, S. (2023). Counting the minimum number of arcs in an oriented graph having weak diameter 2.

Chicago

Das, Sandip, Koushik Kumar Dey, Pavan P D, and Sagnik Sen. 2023. “Counting the Minimum Number of Arcs in an Oriented Graph Having Weak Diameter 2.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2304.00742&authtype=sso&custid=ns315887.