>
Fa
|
Ar
|
En
communications in combinatorics and optimization
سال:2024 - دوره:9 - شماره:2
a counterexample on the conjecture and bounds on χgd-number of mycielskian of a graph
- صفحه:197-204
a new construction for µ-way steiner trades
- صفحه:329-338
a path-following algorithm for stochastic quadratically constrained convex quadratic programming in a hilbert space
- صفحه:353-387
algorithmic complexity of triple roman dominating functions on graphs
- صفحه:217-232
balance theory: an extension to conjugate skew gain graphs
- صفحه:253-262
independence number and connectivity of maximal connected domination vertex critical graphs
- صفحه:185-196
leech graphs
- صفحه:205-215
mathematical results on harmonic polynomials
- صفحه:279-295
power dominator chromatic numbers of splitting graphs of certain classes of graphs
- صفحه:317-327
signed total italian k-domination in digraphs
- صفحه:339-351
some algebraic properties of the subdivision graph of a graph
- صفحه:297-307
the crossing numbers of join product of four graphs on six vertices with discrete graphs
- صفحه:241-252
the length of the longest sequence of consecutive fs-double squares in a word
- صفحه:263-277
total chromatic number for certain classes of lexicographic product graphs
- صفحه:233-240
triangular tile latching system
- صفحه:309-316
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved
