Revisiting the outer-weakly convex domination number in graph products
Pith reviewed 2026-05-23 04:33 UTC · model grok-4.3
The pith
The outer-weakly convex domination number of Cartesian, strong, and lexicographic products of two graphs is determined from the factors.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For any two graphs G and H the outer-weakly convex domination number of their Cartesian product, their strong product, and their lexicographic product equals a specific function of the outer-weakly convex domination numbers of G and H.
What carries the argument
The outer-weakly convex dominating set: a dominating set C whose complement is weakly convex, so that every pair of vertices outside C is connected by a geodesic contained in the complement.
If this is right
- The minimum cardinality for each product is obtained directly from the corresponding numbers on the two factor graphs.
- Certain combinatorial relations among the numbers hold uniformly for the Cartesian, strong, and lexicographic cases.
- The product constructions preserve enough structure to allow exact computation without searching subsets of the vertex set of the product.
Where Pith is reading between the lines
- The same determination technique may apply to other product operations if the convexity condition behaves similarly under the product.
- Large graphs assembled from smaller ones via these products become amenable to direct calculation of the number rather than exhaustive search.
- The results may connect to other domination parameters that incorporate convexity or geodesic conditions.
Load-bearing premise
The definitions of weakly convex sets and outer-weakly convex dominating sets extend directly to the three product graphs in a manner that permits closed-form minimum cardinalities.
What would settle it
A concrete pair of graphs G and H together with one of the three products for which the actual minimum size of an outer-weakly convex dominating set differs from the value given by the claimed determination.
read the original abstract
Let $G = (V, E)$ be a simple undirected connected graph. A set $C \subseteq V(G)$ is weakly convex in $G$ if for every two vertices $u,v$ in $G$, there exists a $u-v$ geodesic whose vertices are in $C$. A set $C \subseteq V$ is an outer-weakly convex dominating set if every vertex not in $C$ is adjacent to some vertex in $C$ and the set $V(G)\setminus C$ is weakly convex in $G$. The outer-weakly convex domination number of graph $G$, denoted by $\widetilde{ \gamma}_{wcon}(G)$, is the minimum cardinality of an outer-weakly convex dominating set of graph $G$. In this paper, we determine the outer-weakly convex domination number of two graphs under the Cartesian, strong and lexicographic products, and discuss some important combinatorial findings.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript defines a weakly convex set C as one where for every pair u,v in the entire graph G there is a u-v geodesic contained in C, then defines an outer-weakly convex dominating set as a dominating set whose complement is weakly convex, and claims to determine the resulting domination number exactly for the Cartesian, strong, and lexicographic products of arbitrary graphs G and H, together with some combinatorial observations.
Significance. Correct closed-form determinations of this parameter on the three standard products would constitute a modest but useful addition to the literature on domination numbers in graph products. The contribution would be strengthened by explicit proofs, small-graph verification, and comparison with related parameters such as convex domination numbers.
major comments (1)
- [Abstract] Abstract (and presumably §1 or §2): the definition of weakly convex set is stated as holding 'for every two vertices u,v in G' rather than 'u,v ∈ C'. Taken literally this requires the complement S = V(G)∖C to contain a geodesic between every pair of vertices in the whole graph, a condition far stronger than any standard notion of weak convexity or geodesic convexity. This renders the claimed exact values for the three product graphs untenable in general and is load-bearing for every subsequent result.
Simulated Author's Rebuttal
We thank the referee for their careful reading of the manuscript and for identifying the issue with the definition of weakly convex sets. We agree that the definition as stated contains an error and will revise it to the standard formulation.
read point-by-point responses
-
Referee: [Abstract] Abstract (and presumably §1 or §2): the definition of weakly convex set is stated as holding 'for every two vertices u,v in G' rather than 'u,v ∈ C'. Taken literally this requires the complement S = V(G)∖C to contain a geodesic between every pair of vertices in the whole graph, a condition far stronger than any standard notion of weak convexity or geodesic convexity. This renders the claimed exact values for the three product graphs untenable in general and is load-bearing for every subsequent result.
Authors: The referee is correct that the definition as written is erroneous and does not match the standard notion of weak convexity (which requires the geodesic condition only for pairs of vertices within the set itself). This appears to be a drafting error in the abstract and introductory sections. The proofs in the paper were developed under the correct standard definition, where weak convexity applies to u, v ∈ C. We will correct the definition in the abstract, introduction, and any other occurrences. With this correction, the exact determinations for the Cartesian, strong, and lexicographic products remain valid. We will also incorporate additional verifications such as small-graph checks and comparisons to convex domination numbers to strengthen the contribution. revision: yes
Circularity Check
No circularity in derivation; results obtained by direct case analysis on product graphs
full rationale
The paper introduces the outer-weakly convex domination number via explicit definitions and then computes its value on Cartesian, strong, and lexicographic products by enumerating minimal sets satisfying the domination and weak-convexity conditions in each product. No parameter is fitted to data and then relabeled as a prediction, no self-citation supplies a load-bearing uniqueness theorem, and no equation is shown to be definitionally identical to its input. The derivation chain therefore consists of independent combinatorial arguments that stand or fall on their own merits rather than reducing to the paper's own assumptions by construction.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Graphs under consideration are simple, undirected, and connected.
Reference graph
Works this paper leans on
-
[1]
L.F. Casinillo, A note on Fibonacci and Lucas number of domination in path, Electronic Journal of Graph Theory and Applications, vol. 6, no. 2, pp. 317-325, 2018
work page 2018
-
[2]
L.F. Casinillo, ”New counting formula for dominating sets in path and cycle graphs,” Journal of Fundamental Mathematics and Applications (J FMA), vol. 3, no. 2, pp. 170-177, 2020
work page 2020
-
[3]
G. Chartrand and P. Zhang, A First Course in Graph Theory, New York: Dover Publication Inc., 2012
work page 2012
-
[4]
J.A., Dayap, and E.L., Enriquez, ”Outer-convex domination in grap hs,” Discrete Mathematics, Algorithms and Applications, vol. 12, no. 1 pp. 205000 8. 2020
work page 2020
-
[5]
T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Domination in Graphs : Advanced Topics, Marcel Dekker, New York, 1998
work page 1998
-
[6]
E.J. Cockayne and S. T. Hedetniemi, ”Towards a theory of domina tion in graph,” Networks Advanced Topics, vol. 7, pp. 247-261, 1977. 10
work page 1977
-
[7]
Jonecis A. Dayap1, Richard T. Alcantara, Roma M. Anoos, Outer -weakly convex domination number of graphs, Communications in Combinatorics and O ptimization, vol. 5 No. 2, 207-215, 2020
work page 2020
-
[8]
J.A. Dayap and E.L. Enriquez, Outer-convex domination in the com position and Cartesian product of graphs, Journal of Global Research in Math ematical Archives, vol. 6, no. 3, 34–41, 2019
work page 2019
-
[9]
J.A. Dayap, J.S. Dionsay, and R.T. Telen, Perfect outer-convex domination in graphs, International Journal of Latest Engineering Research and Applications, vol. 3, no. 7, pp. 25–29, 2018
work page 2018
-
[10]
F. Harary and J. Nieminen, Convexity in graphs, Journal of Diffe rential Ge- ometry, vol. 16 no. 2, pp. 185-190, 1981
work page 1981
-
[11]
M. Tavakoli, F. Rahbarnia and A. R. Ashrafi, Note on strong pro duct of graphs, Kragu- jevac Journal of mathematics, vol. 37, no. 1, pp. 187-193, 2013
work page 2013
-
[12]
J. C´ aceres, C. Hernando, M. Mora, I.M. Pelayo, M. L. Puerta s, C. Seara and D. R. Wood, On the metric dimension of Cartesian products of graph s, SIAM jour- nal on discrete mathematics, vol. 21, no. 2, pp. 423-441, 2007
work page 2007
-
[13]
M. Jannesari and B. Omoomi, The metric dimension of the lexicogr aphic product of graphs, Discrete mathematics, vol. 312 no. 22, pp. 3349-3356 , 2012. 11
work page 2012
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.