Open Access is an initiative that aims to make scientific research freely available to all. To date our community has made over 100 million downloads. It’s based on principles of collaboration, unobstructed discovery, and, most importantly, scientific progression. As PhD students, we found it difficult to access the research we needed, so we decided to create a new Open Access publisher that levels the playing field for scientists across the world. How? By making research easy to access, and puts the academic needs of the researchers before the business interests of publishers.
We are a community of more than 103,000 authors and editors from 3,291 institutions spanning 160 countries, including Nobel Prize winners and some of the world’s most-cited researchers. Publishing on IntechOpen allows authors to earn citations and find new collaborators, meaning more people see your work not only from your own field of study, but from other related fields too.
By Yousef Methkal Abd Algani and Amal Sharif-Rasslan
Let (∁) signify a simplicial complex; the topological connectivity of ∁ is denoted by ζ (∁), which equals ∁+2, where ζ is a function from the class of graphs to the set ℤ+=012…∞. Let the function ζ possesses the following characteristics: 1. ζK0=0. 2. For any graph GVE, there exists an edge xyin G such that ζGVE−xy≥ζGVE where (GVE−xy) means to remove the edge xy from the graph GVE), and ζGVE−Δxy≥ζGVE−1where (GVE−Δ(xy) means to remove the vertices xandy and all their neighbors. Then μ(ΓGVE≥ζGVE. Let ζ0 denote the maximal function ζ that satisfies the aforementioned constraints. Berger proved that μ(ΓGVE≥ζ0GVE for trees and for complements of chordal graphs. Kawamura proved the same theorem for chordal graphs, and Abd Algani proved it for circular-arc graph: Let GVE be a circular-arc graph; if ζ0GVE≤2,thenμΓGVE≤2. In this chapter, we will prove the following theorem: Let GVE be a bipartite graph; if ζ0GVE≤2,thenμΓGVE≤2.