Cardinality Vs Degree of a node in phylogenetic tree

Question

[balanand.jha]

I was reading following research paper:

<cite>Amenta, Nina, Frederick Clarke, and Katherine St John. "A linear-time majority tree algorithm." International Workshop on Algorithms in Bioinformatics. Springer Berlin Heidelberg, 2003.</cite>

While trying to understand the algorithm for creating the majority rule tree, I got confused by the term "cardinality of a bipartition". Is it same thing as the degree of a node or something else?

Thanks

Edit: View the paper here

Answer 1

[Jean-Karim Heriche]

The paper is behind a paywall so I can't read it but assuming the authors use standard graph theory terminology, cardinality of a graph means the number of nodes in the graph. The degree of a node is the number of edges connected to that node.

[balanand.jha]

Thanks for your answer sir, I got the idea. Anyways, I've appended the link to the freely available version of the paper on the web in the post.

Thanks