A function measuring the centrality (or mediality) of an edge in an undirected network with edge capacity

Tight upper bound on the number of edges

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

✍ Zhi-Zhong Chen; Shiqing Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

We show that an n-vertex bipartite K 3,3 -free graph with n 3 has at most 2n -4 edges and that an n-vertex bipartite K 5 -free graph with n 5 has at most 3n -9 edges. These bounds are also tight. We then use the bound on the number of edges in a K 3,3 -free graph to extend two known NC algorithms fo