Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices
verfasst von : Hongwei Wang
Erschienen in: Combinatorial Optimization and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Riddle [15] showed that the forcing number of a bipartite graph is bounded blow by the minimum number of trailing vertices of the ordering of a color set. In the present work, we improve the trailing-vertex method by Riddle and obtain a necessary condition for the matching forcing number of a bipartite graph being equal to a given natural number
k
; furthermore, we give a sufficient and necessary condition for the minimum forcing number of bipartite graph being equal to the minimum number of trailing vertices of all standard orderings of a color set.