Browsing by Subject "05C69"
Now showing items 1-10 of 10
-
A linear time algorithm for minimum equitable dominating set in trees
Proyecciones (Antofagasta, On line); Vol. 40 No. 4 (2021); 805-814. -
Dual digraphs of finite semidistributive lattices
CUBO, A Mathematical Journal; Vol. 24 No. 3 (2022); 369–392. -
Maximal matching cover pebbling number for variants of hypercube
Proyecciones (Antofagasta, On line); Vol. 42 No. 4 (2023); 931-956. -
On local antimagic chromatic numbers of circulant graphs join with null graphs or cycles
Proyecciones (Antofagasta, On line); Vol. 42 No. 5 (2023); 1307-1332. -
Open global shadow graph and it’s zero forcing number
Proyecciones (Antofagasta, On line); Vol. 42 No. 1 (2023); 33-52. -
The edge-to-edge geodetic domination number of a graph
Proyecciones (Antofagasta, On line); Vol. 40 No. 3 (2021); 635-658. -
The nonsplit domination in subdivision graphs
Proyecciones (Antofagasta, On line); Vol. 39 No. 5 (2020); 1113-1120. -
Trees with vertex-edge Roman Domination number twice the domination number minus one
Proyecciones (Antofagasta, On line); Vol. 39 No. 6 (2020); 1381-1392. -
Vertex cover and Edge vertex domination in trees
Proyecciones (Antofagasta, On line); Vol. 40 No. 5 (2021); 1147-1154. -
Zero forcing in Benzenoid network
Proyecciones. Journal of Mathematics; Vol 38 No 5 (2019); 999-1010.