A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
نویسندگان
چکیده
منابع مشابه
Small graphs with exactly two non-negative eigenvalues
Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)
متن کاملEdge-Coloring Bipartite Graphs
Given a bipartite graph G with n nodes, m edges and maximum degree ∆, we find an edge coloring for G using ∆ colors in time T +O(m log ∆), where T is the time needed to find a perfect matching in a k-regular bipartite graph with O(m) edges and k ≤ ∆. Together with best known bounds for T this implies an O(m log ∆ + m ∆ log m ∆ log ∆) edge-coloring algorithm which improves on the O(m log ∆+ m ∆ ...
متن کاملEdge Coloring Bipartite Graphs Eeciently
The chromatic index of a bipartite graph equals the maximal degree of its vertices. The straightforward way to compute the corresponding edge coloring using colors, requires O((2 n 3=2) time. We will show that a simple divide & conquer algorithm only requires O((3=2 n 3=2) time. This algorithm uses an algorithm for perfect k-matching in regular bipartite graphs as a sub-routine. We will show th...
متن کاملfull edge-friendly index sets of complete bipartite graphs
let $g=(v,e)$ be a simple graph. an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where $z_2={0,1}$ is the additive group of order 2. for $iin{0,1}$, let $e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$. a labeling $f$ is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. $i_f(g)=v_f(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2016
ISSN: 0024-3795
DOI: 10.1016/j.laa.2016.03.007