Answers are grounded in this paper and cite their sources.
This analysis investigates properties of 1-König-Egerváry graphs, revealing structural implications in graph theory.
Let α (G) α ( G ) denote the cardinality of a maximum independent set, while μ (G) μ ( G ) be the size of a maximum matching in G=( V,E) G = V , E . Let ξ (G) ξ ( G ) denote the size of the intersection of all maximum independent sets [12]. It is known that if α (G)+μ (G)=n(G)=| V| α ( G ) + μ ( G ) = n ( G ) = V , then G is a König-Egerváry graph [5, 7, 24]. If α (G)+μ (G)=n(G)-1 α ( G ) + μ ( G ) = n ( G ) - 1 , then G is a 1 -König-Egerváry graph . If G is not a König-Egerváry graph, and there exists a vertex v∈ V v ∈ V (an edge e∈ E e ∈ E ) such that $$G-v$$ G - v ( $$G-e$$ G - e ) is König-Egerváry, then G is called a vertex (an edge) almost König-Egerváry graph (respectively). For X⊆ V(G) X ⊆ V ( G ) , the number | X| -| N(X)| X </mml:mfe
No takes yet. Share an insight, caveat, or question.
Levit et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: