O'Reilly logo

Analysis of Complex Networks by Frank Emmert-Streib, Matthias Dehmer

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

13.3 Treelike Equalities and Euler-Type Inequalities

In this section we present treelike equalities and Euler type inequalities for median graphs and their generalizations: quasi-median graphs, partial cubes, and cage-amalgamation graphs.

13.3.1 Treelike Eequalities and Euler-Type Inequalities for Median Graphs

Let G be a median graph. Two splits{A, images} and {B, images} of G are said to be incompatible if all four of the possible intersections AB, Aimages, imagesB, and imagesimages are nonempty (otherwise they are called compatible). The corresponding Θ-classes FA and FB are said to cross if the splits{A, images} and {B, images} are incompatible. The next theorem, probably observed for the first time by Isbell [44] (in slightly different ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required