>
Fa
|
Ar
|
En
communications in combinatorics and optimization
سال:2022 - دوره:7 - شماره:2
a note on roman k-tuple domination number
- صفحه:273-274
a survey on the intersection graphs of ideals of rings
- صفحه:121-167
algorithmic aspects of certified domination in graphs
- صفحه:247-255
algorithmic aspects of total roman {2}-domination in graphs
- صفحه:183-192
complexity of the paired domination subdivision problem
- صفحه:177-182
eccentric completion of a graph
- صفحه:193-201
entire wiener index of graphs
- صفحه:227-245
enumeration of k-noncrossing trees and forests
- صفحه:301-311
extreme outer connected monophonic graphs
- صفحه:211-226
inverse problem for the forgotten and the hyper zagreb indices of trees
- صفحه:203-209
on the total liar’s domination of graphs
- صفحه:169-175
regular graphs with large italian domatic number
- صفحه:257-271
terminal status of vertices and terminal status connectivity indices of graphs with its applications to properties of cycloalkanes
- صفحه:275-300
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved
