>
Fa
|
Ar
|
En
communications in combinatorics and optimization
سال:2019 - دوره:4 - شماره:2
a characterization of trees with equal roman {2}-domination and roman domination numbers
- صفحه:95-107
different-distance sets in a graph
- صفحه:151-171
directed domination in oriented hypergraphs
- صفحه:173-183
girth, minimum degree, independence, and broadcast independence
- صفحه:131-139
k-efficient partitions of graphs
- صفحه:109-122
on hop roman domination in trees
- صفحه:201-208
on the edge-connectivity of c4-free graphs
- صفحه:141-150
on trees with equal roman domination and outer-independent roman domination numbers
- صفحه:185-199
paired-domination game played in graphs
- صفحه:79-94
t-pancyclic arcs in tournaments
- صفحه:123-130
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved
