نتایج جستجو برای: complete forcing number

تعداد نتایج: 1492568  

Journal: :Discrete Applied Mathematics 2014

Journal: :Involve, a Journal of Mathematics 2015

Journal: :Discussiones Mathematicae Graph Theory 1999
Gary Chartrand Ping Zhang

For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u − v geodesic in G. If S is a set of vertices of G, then I(S) is the union of all sets I(u, v) for u, v ∈ S. A set S is a geodetic set if I(S) = V (G). A minimum geodetic set is a geodetic set of minimum cardinality and this cardinality is the geodetic number g(G). A subset T of a minimum geodetic set...

Journal: :Australasian J. Combinatorics 2007
Damir Vukicevic Tomislav Doslic

Journal: :Discrete Applied Mathematics 2019

Journal: :The Electronic Journal of Linear Algebra 2012

Journal: :Discrete Applied Mathematics 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید