Abstract
Let r(G), ρo(G), and γt(G) denote the P3-Radon number, the open packing number, and the total domination number of a graph G. We prove that r(T)≤2ρo(T)+1 for every tree T and r(G)<2γt(G)+1 for every non-trivial regular graph G.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
