Abstract
We define the Carrier Poset, (P G ≤ P G ), for a biconnected simple graph G. The incidence algebra A(P G ), for this poset is considered by studying a certain class of functions f called broken cycle content functions. We describe matrices Mj of these functions as elements of A(P G ) with respect to a particular linear order on P G . For any such broken cycle content matrix for a full span chain. with the pre-cut and post-cut properties. in (P G ≤ P G ), we show that there is an associated submatrix of Mp which is upper triangular weakly decreasing in rows, and weakly increasing in columns. we study full span bicomponent trees for biconnected simple graphs and interpret our results on chains in terms of these structures. These results suggest a general mathematical view of why certain classical optimal graph algorithms always seem to work in regions of P G associates with such full span chains.
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.
