کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8900499 1631600 2018 37 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Almost balanced biased graph representations of frame matroids
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Almost balanced biased graph representations of frame matroids
چکیده انگلیسی
Given a 3-connected biased graph Ω with a balancing vertex, and with frame matroid F(Ω) nongraphic and 3-connected, we determine all biased graphs Ω′ with F(Ω′)=F(Ω). As a consequence, we show that if M is a 4-connected nongraphic frame matroid represented by a biased graph Ω having a balancing vertex, then Ω essentially uniquely represents M. More precisely, all biased graphs representing M are obtained from Ω by replacing a subset of the edges incident to its unique balancing vertex with unbalanced loops.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Advances in Applied Mathematics - Volume 96, May 2018, Pages 139-175
نویسندگان
, ,