Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Almost Bipartite non-König-Egerváry Graphs Revisited

Published 21 May 2024 in math.CO and cs.DM | (2405.13176v1)

Abstract: Let α(G)\alpha(G) denote the cardinality of a maximum independent set, while μ(G)\mu(G) be the size of a maximum matching in G=(V,E)G=\left( V,E\right) . It is known that if α(G)+μ(G)=∣V∣\alpha(G)+\mu(G)=\left\vert V\right\vert , then GG is a K\"{o}nig-Egerv\'{a}ry graph. The critical difference d(G)d(G) is max⁡{d(I):I∈Ind(G)}\max\{d(I):I\in\mathrm{Ind}(G)\}, where Ind(G)\mathrm{Ind}(G)\ denotes the family of all independent sets of GG. If A∈Ind(G)A\in\mathrm{Ind}(G) with d(X)=d(G)d\left( X\right) =d(G), then AA is a critical independent set. For a graph GG, let diadem(G)=⋃{S:S\mathrm{diadem}(G)=\bigcup\{S:S is a critical independent set in G}G\}, and ϱv(G)\varrho_{v}\left( G\right) denote the number of vertices v∈V(G)v\in V\left( G\right) , such that G−vG-v is a K\"{o}nig-Egerv\'{a}ry graph. A graph is called almost bipartite if it has a unique odd cycle. In this paper, we show that if GG is an almost bipartite non-K\"{o}nig-Egerv\'{a}ry graph with the unique odd cycle CC, then the following assertions are true: 1. every maximum matching of GG contains ⌊V(C)/2⌋\left\lfloor {V(C)}/{2}\right\rfloor edges belonging to CC; 2. V(C)∪NG[diadem(G)]=VV(C)\cup N_{G}\left[ \mathrm{diadem}\left( G\right) \right] =V and V(C)∩NG[diadem(G)]=∅V(C)\cap N_{G}\left[ \mathrm{diadem}\left( G\right) \right] =\emptyset; 3. ϱv(G)=∣corona(G)∣−∣diadem(G)∣\varrho_{v}\left( G\right) =\left\vert \mathrm{corona}\left( G\right) \right\vert -\left\vert \mathrm{diadem}\left( G\right) \right\vert , where corona(G)\mathrm{corona}\left( G\right) is the union of all maximum independent sets of GG; 4. ϱv(G)=∣V∣\varrho_{v}\left( G\right) =\left\vert V\right\vert if and only if G=C2k+1G=C_{2k+1} for some integer k≥1k\geq1.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.