scientific article; zbMATH DE number 15494

MaRDI QIDQ3972129zbMATH OpenFDO

Authors Izak Broere, Gary Chartrand, Ortrud R. Oellermann, Curtiss E. Wall

Publication date 25 June 1992

zbMATH Keywords

edge connectivityedge independence numberregular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Review text

[For the entire collection see Zbl 0699.00014.] Let \(G\) be an \(r\)-regular, \((r-2)\)-edge-connected graph, \(r\geq 3\), of order \(p\) and let \(\ell\) be an integer such that \(0\leq \ell \leq \lfloor {p\over 2}\rfloor\). If \(p\) is even and \(p<2(\ell +1)(r \lfloor {r\over 2}\rfloor + r-1)\), then there are at least \((p-2\ell)/2\) independent edges in \(G\). Similar result for \(p\) odd is given and it is proved that for \(r\geq 4\) the bounds are best possible.

Recommendations

• On the edge-independence number and edge-covering number for regular graphs
• Variations on a theorem of Petersen
• scientific article; zbMATH DE number 3867381
• Maximum matchings in a regular graph of specified connectivity and bounded order
• Matching and edge-connectivity in regular graphs

Cited in

(6)

• scientific article; zbMATH DE number 3867381 (Why is no real title available?)
• On the edge-independence number and edge-covering number for regular graphs
• Maximum matchings in a regular graph of specified connectivity and bounded order
• scientific article; zbMATH DE number 2094762 (Why is no real title available?)
• Matching and edge-connectivity in regular graphs
• Variations on a theorem of Petersen

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972129)