Abstract
In this paper, we determine maximum total irregularity of two types of connected totally segregated bicyclic graphs on \(n\) vertices: extended \(\infty\) bicyclic graph and \(\Theta\)-bicyclic graph and also characterize those extremal graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
