# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Connectivity in frame matroids. (English) Zbl 1170.05323
Summary: We discuss the relationship between the vertical connectivity of a biased graph $𝛺$ and the Tutte connectivity of the frame matroid of $𝛺$ (also known as the bias matroid of $𝛺\right)$.
##### MSC:
 05C40 Connectivity 05C22 Signed and weighted graphs 05B35 Matroids, geometric lattices (combinatorics)
##### Keywords:
frame matroid; connectivity; biased graph
##### References:
 [1] Oxley, J. G.: Matroid theory, (1992) [2] S.R. Pagano, Separability and representability of bias matroids of signed graphs, Ph.D. thesis, State University of New York at Binghamton, 1998. [3] Slilaty, D. C.: On cographic matroids and signed-graphic matroids, Discrete math. 301, No. 2 – 3, 207-217 (2005) · Zbl 1078.05017 · doi:10.1016/j.disc.2005.07.003 [4] D.C. Slilaty, Projective-planar signed graphs and tangled signed graphs, J. Combin. Theory Ser. B, to appear. · Zbl 1123.05046 · doi:10.1016/j.jctb.2006.10.002 [5] Tutte, W. T.: Connectivity in matroids, Canad. J. Math. 18, 1301-1324 (1966) · Zbl 0149.21501 · doi:10.4153/CJM-1966-129-2 [6] Tutte, W. T.: Graph theory, encyclopedia of mathematics and its applications, Graph theory, encyclopedia of mathematics and its applications 21 (1984) [7] Wagner, D. K.: Connectivity in bicircular matroids, J. combin. Theory ser. B 39, No. 3, 308-324 (1985) · Zbl 0584.05019 · doi:10.1016/0095-8956(85)90057-7 [8] Zaslavsky, T.: Vertices of localized imbalance in a biased graph, Proc. amer. Math. soc. 101, No. 1, 199-204 (1987) · Zbl 0622.05054 · doi:10.2307/2046575 [9] Zaslavsky, T.: Biased graphs. I. bias, balance, and gains, J. combin. Theory ser. B 47, No. 1, 32-52 (1989) · Zbl 0714.05057 · doi:10.1016/0095-8956(89)90063-4 [10] Zaslavsky, T.: Biased graphs whose matroids are special binary matroids, Graphs combin. 6, No. 1, 77-93 (1990) · Zbl 0786.05020 · doi:10.1007/BF01787483 [11] Zaslavsky, T.: Biased graphs. II. the three matroids, J. combin. Theory ser. B 51, No. 1, 46-72 (1991) · Zbl 0763.05096 · doi:10.1016/0095-8956(91)90005-5