Abstract
A biased graph consists of a graph Γ \Gamma and a subclass B \mathcal {B} of the polygons of Γ \Gamma , such that no theta subgraph of Γ \Gamma contains exactly two members of B \mathcal {B} . A subgraph is balanced when all its polygons belong to B \mathcal {B} . A vertex is a balancing vertex if deleting it leaves a balanced graph. We give a construction for unbalanced biased graphs having a balancing vertex and we show that an unbalanced biased graph having more than one balancing vertex is an unbalanced series or parallel connection of balanced graphs.
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.
