The smallest number of vertices that have to be deleted from a graph G to obtain a bipartite subgraph is called the bipartite vertex frustration of G and denoted by Ο(G). In this paper, some extremal properties of this graph invariant are presented. Moreover, we present an exact formula for the bipa
β¦ LIBER β¦
The Bipartite Vertex Frustration of Some Infinite Families of Fullerenes
β Scribed by Yarahmadi, Z.; Ashrafi, A. R.
- Book ID
- 118242581
- Publisher
- Taylor and Francis Group
- Year
- 2013
- Tongue
- English
- Weight
- 303 KB
- Volume
- 21
- Category
- Article
- ISSN
- 1536-383X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Extremal properties of the bipartite ver
β
Zahra Yarahmadi; Ali Reza Ashrafi
π
Article
π
2011
π
Elsevier Science
π
English
β 242 KB
The Vertex PI and Szeged Polynomials of
β
Ghorbani, Modjtaba; Hemmasi, Mahsa
π
Article
π
2010
π
American Scientific Publishers
π
English
β 815 KB
The Topological Study of an Infinite Fam
β
Faghani, M.; Ashrafi, A. R.
π
Article
π
2013
π
Taylor and Francis Group
π
English
β 249 KB
Some Infinite Families of Locally Partia
β
CΓ©cile Huybrechts
π
Article
π
1994
π
Elsevier Science
π
English
β 424 KB
Starting with a subgeometry \(\Omega\) embedded in a \(\beta\)-dimensional projective space \(P G(\beta, q)\), \(\beta \geqslant 1\), we construct inductively a series of rank \(n\) residually connected geometries \(\Gamma^{(n, \beta, \Omega)}\), \(n \geqslant \beta\), by putting \(\Gamma^{(\beta, \
On the construction oft-designs and the
β
Tran van Trung
π
Article
π
1986
π
Springer
π
English
β 228 KB
Values of minors of some infinite famili
β
C. Koukouvinos; M. Mitrouli; Jennifer Seberry
π
Article
π
2005
π
Elsevier Science
π
English
β 262 KB