Bias Matroids With Unique Graphical Representations

Dan Slilaty

Bias Matroids With Unique Graphical Representations

Wright State University

Research output: Contribution to journal › Article › peer-review

Abstract

Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of Ω is uniquely represented by Ω.

Original language	American English
Journal	Discrete Mathematics
Volume	306
State	Published - Jan 1 2006

Disciplines

Applied Mathematics
Applied Statistics
Mathematics
Physical Sciences and Mathematics
Statistics and Probability

Access to Document

Bias Matroids With Unique Graphical RepresentationsFinal published version, 115 KBLicense: Unspecified

Cite this

@article{f94e2923c5f54af8aaf19c706aba5f17,

title = "Bias Matroids With Unique Graphical Representations",

abstract = "Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of Ω is uniquely represented by Ω.",

author = "Dan Slilaty",

year = "2006",

month = jan,

day = "1",

language = "American English",

volume = "306",

journal = "Discrete Mathematics",

}

TY - JOUR

T1 - Bias Matroids With Unique Graphical Representations

AU - Slilaty, Dan

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of Ω is uniquely represented by Ω.

AB - Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of Ω is uniquely represented by Ω.

UR - https://corescholar.libraries.wright.edu/math/322

M3 - Article

VL - 306

JO - Discrete Mathematics

JF - Discrete Mathematics

ER -

Bias Matroids With Unique Graphical Representations

Abstract

Disciplines

Access to Document

Other files and links

Cite this