Abstract
A dominating set in a graph G is a set of vertices such that any vertex of is adjacent to at least one vertex of A dominating set S of G is said to be a perfect dominating set if each vertex in is adjacent to exactly one vertex in S. The minimum cardinality of a perfect dominating set is the perfect domination number A function is a perfect Roman dominating function (PRDF) on G if every vertex for which is adjacent to exactly one vertex v for which . The weight of a PRDF is the sum of its function values over all vertices, and the minimum weight of a PRDF of G is the perfect Roman domination number In this paper, we prove that for any nontrivial tree T, and we characterize all trees attaining this bound.
1. Introduction
In this paper, only simple and undirected graph without isolated vertices will be considered. The set of vertices of the graph G is denoted by and the edge set is . The order of a graph G is the number of vertices of the graph G and it is denoted by . The size of G is the cardinality of the edge set and it is denoted by For a vertex , the open neighbourhood is the set , the closed neighbourhood of v is the set , and the degree of v is . Any vertex of degree one is called a leaf, a support vertex is a vertex adjacent to a leaf, a strong support vertex is a support vertex adjacent to at least two leaves and an end support vertex is a support vertex such that all its neighbors, except possibly one, are leaves. For a graph G, let and . The distance between two vertices u and v in a connected graph G is the length of a shortest path in The diameter of G, denoted by , is the maximum value among distances between all pair of vertices of G. For a vertex v in a rooted tree T, let and denote the set of children and descendants of v, respectively and let . Moreover, the depth of v, , is the largest distance from v to a vertex in . The maximal subtree rooted at v, denoted by , consists of v and all its descendants. We write for the path of order n. A tree T is a double star if it contains exactly two vertices that are not leaves. A double star with, respectively p and q leaves attached at each support vertex is denoted For a real-valued function the weight of f is , and for we define . So .
A dominating set (DS) in a graph G is a set of vertices such that any vertex of is adjacent to at least one vertex of A dominating set S of G is said to be a perfect dominating set (PDS) if each vertex in is adjacent to exactly one vertex in S. The minimum cardinality of a (perfect) dominating set of a graph G is the (perfect) domination number (). Perfect domination was introduced by Livingston and Stout in [1] and has been studied by several authors [2,3,4,5,6].
A function is a Roman dominating function (RDF) on G if every vertex for which is adjacent to at least one vertex v for which . A perfect Roman dominating function (PRDF) on a graph G is an RDF f such that every vertex assigned a 0 is adjacent to exactly one vertex assigned a 2 under The minimum weight of a (perfect) RDF on a graph G is the (perfect) Roman domination number (). A (perfect) RDF on G with weight () is called a -function (-function). An RDF f on a graph can be represented by the ordered partition of V, where for . The concept of Roman domination was introduced by Cockayne et al. in [7] and was inspired by the manuscript of the authors of [8], and Stewart [9] about the defensive strategy of the Roman Empire decreed by Constantine I The Great, while perfect Roman domination was introduced by Henning, Klostermeyer and MacGillivray in [10] and has been studied in [11,12,13]. For more on Roman domination, we refer the reader to the book chapters [14,15] and surveys [16,17,18].
It was shown in [10] that for any tree G of order , . Moreover, the authors have characterized all trees attaining this upper bound. Note that the previous upper bound have been improved by Henning and Klostermeyer [13] for cubic graphs of order n by showing that .
It is worth mentioning that if S is a minimum (perfect) dominating set of a graph G, then clearly is a (perfect) RDF and thus
On the other hand, if is a -function, then is a dominating set of G yielding
It is natural to ask whether the inequality (2) remains valid between and for any graph The answer is negative as it can be seen by considering the graph H obtained from a double star with central vertices by subdividing the edge with vertex w, and adding new vertices, where k vertices are attached to both u and w and the remaining k vertices are attached to both v and w (see Figure 1). Clearly, while and so the difference can be even very large.
Figure 1.
The graph H.
Motivated by the above example, we shall show in this paper that for every nontrivial tree T, and we characterize all trees attaining this bound.
2. Preliminaries
We start by providing some useful definitions and observations throughout the paper.
Definition 1.
For any graph G, let
Definition 2.
Let u be a vertex of a graph G. A set S is said to be an almost perfect dominating set (almost PDS) with respect to (i) if each vertex has exactly one neighbor in and (ii) if , then u has at most one neighbor in S. Let
Trivially, every PDS of G is an almost PDS with respect to any vertex of G and thus is well defined. Hence for each vertex . Let
The proof of the following two results are given in [12].
Observation 1.
Let G be a graph.
- 1.
- Any strong support vertex belongs to .
- 2.
- Any support vertex adjacent to a strong support vertex, belongs to .
- 3.
- For any leaf u of G, there is a -function f such that .
Proposition 1.
Let G be a graph. G has a -function that assigns 2 to every end strong support vertex. Thus every end strong support vertex of a graph G belongs to .
The next result is a consequence of Observation 1 and Proposition 1.
Corollary 1.
Let u be an end strong support vertex of a graph H. If G is the graph obtained from H by adding a vertex x and an edge, thenand.
Proposition 2.
Let H be a graph and . If G is a graph obtained from H by adding a path attached at u by an edge then:
- 1.
- and
- 2.
- If , then
- 3.
- If , then
Proof.
- For a -set let if , and if . Clearly, is a PDS of G and thus .Now let f be a -function. Obviously, . If , then the function f restricted to H is a PRDF on H yielding . Thus assume that . Then and the function defined by and for is a PRDF on H of weight Hence in any case, .
- Assume first that and let f be a -function with . Then f can be extended to a PRDF of G by assigning a 1 to and a 0 to and thus . The equality follows by item Assume now that and let f be a -function. By the definition of , we must have to Roman dominate u. Now, if , then using the same argument as above we obtain . Hence assume that . Then the function defined by , and for all is a PRDF of G of weight . Therefore , and the equality follows by item 1.
- Let S be a -set. Clearly, and is an almost PDS of H with respect to u. Since , we have . Therefore , and the equality follows from item 1. □
For a graph G and a vertex u of G, we denote by the graph obtained from G by adding a star and joining one of its leaf to u.
Proposition 3.
Let G be a graph and u a vertex of G.
- 1.
- and
- 2.
- If , then .
- 3.
- If , then .
Proof.
Let x be the center of the star and a leaf of attached at u by an edge
- For a -set let if and for otherwise. Clearly, is a PDS of and thus .Now, let f be a -function. By Proposition 1, we may assume that . If , then the function f restricted to G is a PRDF on G of weight at most . Thus, we assume that . Then the function defined by and for all is a PRDF on G of weight In any case, .
- Let S be a -set. By Observation 1-(1), we have . Now, if , then and clearly is a PDS of implying that . Thus, assume that . If , then is a PDS of G that does not contain u and since we deduce that Hence . If , then is an almost PDS of G and since we conclude that Hence . Whatever the case, the equality follows from item 1.
- Assume that and let f be a -function such that . Then f can be extended to a PRDF on by assigning a 2 to x and a 0 to every neighbor of x and thus . The equality follows from item 1. □
Proposition 4.
Let be a graph and let u be an end support vertex of which is adjacent to a strong support vertex v. If G is a graph obtained from by adding a vertex x and an edge , then and . Moreover, if , then .
Proof.
Let S be a -set. By Observation 1, Thus for otherwise u would have two neighbors in Hence S is a PDS of G and so . On the other hand, by Observation 1, any -set contains both u and and thus remains a PDS of It follows that , and the desired equality is obtained.
Since u is an end strong support vertex in By Proposition 1, there is a -function f such that , and clearly f restricted to is a PRDF on yielding .
Now, assume that and let g be a -function with Then g can be extended to a PRDF on G by assigning a 0 to Thus , and the desired equality follows. □
Proposition 5.
Let be a graph and u a vertex of If G is a graph obtained from by adding a double star attached at u by one of its leaves, then:
- 1.
- and .
- 2.
- If , then .
- 3.
- If , then .
Proof.
Let be the non-leaf vertices of the double star , and let and . We assume that
- For a -set let if and if . Clearly, is a PDS of G and thus .Consider now a -function f such that (according to Proposition 1). Clearly, . If , then f restricted to is a PRDF on of weight at most and thus . If , then and the function defined by and otherwise, is a PRDF on of weight at most yielding . In any case we have .
- Assume that and let f be a -function such that . Then f can be extended to a PRDF on G by assigning a 2 to y, a 1 to and a 0 to Hence , and the desired equality follows from item 1.
- Assume that , and let S be a -set. By items 1 and 2 of Observation 1, . If , then and thus is a PDS of implying that . Hence, assume that . If , then is a PDS of that does not contain u. But since we deduce that which yields . Thus suppose that . Then is an almost PDS of and since we conclude that . Hence , and the desired equality is obtained by item 1. □
Proposition 6.
Let be a graph and let u be an end strong support vertex of degree 3 whose non-leaf neighbor is a support vertex, say of degree 3, where Let G be a graph obtained from by adding four vertices, where two are attached to a leaf of u and the other two are attached to the leaf of v. Then and .
Proof.
Let and Let and be the four added vertices, where By items 1 and 2 of Observation 1, any -set contains u and Clearly such a set can be extended to a PDS of G by adding which yields . On the other hand, let D be a -set. Then by items 1 and 2 of Observation 1, we have , and thus is a PDS of implying that . Therefore .
Next we shall show that . First we show that . Since u is an end strong support vertex of let f be a -function with (by Proposition 1) such that is as small as possible. If , then and thus the function defined by , , and otherwise, is a PRDF on Hence . If , then by our choice of we have for any and thus the function defined by for and , , and otherwise, is a PRDF on G yielding . Hence . Now we show that . By Proposition, let g be a -function such that It can be seen that . If , then the function defined by , , and otherwise, is a PRDF on of weight at most . If , then the function defined by , and otherwise, is a PRDF on of weight at most In any case, , and the equality follows. □
3. The Family
In this section, we define the family of unlabeled trees T that can be obtained from a sequence of trees such that and . If , then is obtained recursively from by one of the following operations.
Operation : If is an end strong support vertex, then adds a vertex x attached at u by an edge to obtain .
Operation : If , then adds a path attached at u by an edge to obtain .
Operation : If , then adds a star centered at x by attaching one of its leaves, say , to u to obtain .
Operation : If is an end support vertex which is adjacent to a strong support vertex, then adds a vertex x attached at u by an edge to obtain .
Operation : If , then adds a double star by attaching one of its leaves, say , to u to obtain .
Operation : If is an end strong support vertex of degree 3 with such that u is adjacent to a support vertex v of degree 3 with then adds four vertices attached at x and y by edges to obtain .
Lemma 1.
If is a tree with and is a tree obtained from by one of the Operations , then .
Proof.
If is obtained from by Operation , then by Corollary 1 and the assumption , we have If is obtained from by Operation , then as above the result follows from Proposition 2 (items 2, 3 and 4). If is obtained from by Operation , then the result follows from Proposition 3 (items 2 and 3). If is obtained from by Operation , then the result follows from Proposition 4. If is obtained from by Operation , then the result follows from Proposition 5. Finally, if is obtained from by Operation , then the result follows from Proposition 6. □
In the rest of the paper, we shall prove our main result:
Theorem 1.
For any tree T of order ,
with equality if and only if .
4. Proof of Theorem 1
Lemma 2.
If , then .
Proof.
Let T be a tree of . Then there exists a sequence of trees such that , and if , then can be obtained from by one of the aforementioned operations. We proceed by induction on the number of operations used to construct T. If , then and clearly . This establishes our basis case. Let and assume that the result holds for each tree which can be obtained from a sequence of operations of length and let . By the induction hypothesis, . Since is obtained from by one of the Operations (), we conclude from Lemma 1 that . □
Theorem 2.
For any tree T of order ,
with equality only if .
Proof.
We use an induction on n. If , then , where and . If and , then where and because it can be obtained from by applying Operation . If and , then where and clearly since it can be obtained from by Operation . Let and assume that every tree of order with satisfies with equality only if .
Let T be a tree of order If , then T is a star, where and because T it can be obtained from by frequently use of Operation . Hence assume that , and thus T is a double star . If , then and since it is obtained from by applying Operation . If , then , and so . Henceforth, we assume that . Let be a diametrical path in T such that is as large as possible. Root T at and consider the following cases.
Case 1..
Let . By Corollary 1 and the induction hypothesis on , we obtain
Further if then we have equality throughout this inequality chain. In particular, By induction on we have . It follows that since it can be obtained from by applying operation
Case 2..
Let . For a -set let if and for otherwise. Clearly is a PDS of T and thus . Consider now a -function f. If , then and the function f, restricted to is a PRDF on of weight at most . If , then and the function defined by and otherwise, is a PRDF on In any case, . By the induction hypothesis on we obtain
Case 3. and .
Let . By Proposition 2, we have and . It follows from the induction hypothesis that
Further if then we have equality throughout this inequality chain. In particular, , and . By induction on we deduce that . Next, we shall show that . Let f be a -function. If , then and and the function is a -function with and hence . Hence, assume that . Then . If or and , then the function f restricted to is a PRDF on of weight contradicting the fact . Hence we assume and . Then the function defined by and otherwise, is a -function and so . Hence It remains to show that . Suppose that and let S be an almost PDS of of size less that Clearly, and has no neighbor in S. Therefore, is a PDS of T of size at most , a contradiction. Hence . It follows that since it can be obtained from by Operation
Case 4..
Let . According to Cases 1, 2 and 3, we may assume that any end support vertex on a diametrical path has degree 3. Consider the following subcases.
Subcase 4.1..
Let . By Proposition 3-(1) and the induction hypothesis we have:
Further if then we have equality throughout this inequality chain. In particular, , and . It follows from the induction hypothesis that . In the next, we shall show that .
Suppose that and let S be a -set that does not contain . Then is a PDS of T, contradicting the fact . Hence . Suppose now that and let D be an almost PDS of with respect to such that . Then and has no neighbor in D, and thus is a PDS of T of cardinality less a contradiction. Hence . It remains to show that . By Proposition 1, let f be a -function such that If , then we must have But f restricted to is a PRDF on of weight at most contradicting . Hence . If and , then the function defined by and otherwise, is a PRDF of of weight at most a contradiction as above. Thus or and . Then f restricted to is a -function showing that . Hence . Therefore, because it can be obtained from by Operation
Subcase 4.2..
We distinguish between some situations.
- (a)
- is a strong support vertex.Let . By Proposition 4 and the induction hypothesis we have:Further if then we have equality throughout this inequality chain. In particular, , and . By the induction hypothesis, . To show , let f be a -function such that (by Proposition 1). Since f is also a -function with implying that . Therefore because it can be obtained from by Operation
- (b)
- has two children with depth one, different from .Then u and w are both strong support vertices of degree 3. Let . By Observation 1, any -set S contains x and y and thus . Hence is a PDS of T yielding . Now, let f be a function such that and (by Proposition 1). Then . It follows that the function f restricted to is a PRDF on of weight , and hence . By the induction hypothesis we have
- (c)
- is a support vertex and has a child u with depth one different from .Let be the unique leaf adjacent to . Note that u is a strong support vertices of degree 3. Let . If S is a -set, then by Observation 1-(2), and thus is a PDS of T yielding . By Proposition 1, let f be a -function such that and By the definition of perfect Roman dominating functions, we have . Then, the function f restricted to is a PRDF on of weight and thus . It follows from the induction hypothesis thatAccording to (a), (b) and (c), we can assume for the next that .
- (d)
- and has a child x with depth one different from .Note that x is a strong support vertices of degree 3. Let and let be the tree obtained from T by removing the set of vertices . For a -set let if and when . Clearly, is a PDS of T and so . Now let f be a -function such that . Then and the function f restricted to is a PRDF on of weight at most . By the induction hypothesis we have:
- (e)
- and is adjacent to exactly one leaf .If has a child s with depth one and degree two, then let be the tree obtained from T by removing s and its unique leaf. This case can be treated in the same way as in Case 3. Moreover, if has a child s with depth one and degree at least four, then let be the tree obtained from T by removing a leaf neighbor of This case can be treated in the same way as in Case 1. Hence, we may assume that each child of is a leaf or a vertex with depth one and degree 3 or a vertex with depth two whose maximal subtree is isomorphic to . First assume that , and let . Clearly, any -set contains and such a set can be extended to a PDS of T by adding . Hence . Now let f be a -function such that . Clearly, . If or and , then the function f restricted to is a PRDF on and thus . Hence assume that and . Then the function defined by and otherwise, is a PRDF of of weight and thus . By the induction hypothesis we have:From now on, we can assume that . We examine different cases.
- (e.1.)
- has a child x of degree 3 and depth 1.Let and let be the tree obtained from T by removing the set . By Proposition 6, we have and . We deduce from the induction hypothesis thatFurther if then we have equality throughout this inequality chain. In particular, . By induction on we have . Therefore since it can be obtained from by Operation .
- (e.2.)
- has a child with depth two.Note that and are isomorphic. Let , and observe that is a leaf in Since any -set can be extended to a PDS of T by adding and the support vertices of we obtain . Moreover, as above we can see that Now, by induction hypothesis we obtain:
- (e.3.)
- .Let . If then it can be seen that T is tree with and implying that Hence we assume that is nontrivial. By Proposition 5 and by the inductive hypothesis we have:Further if then we have equality throughout this inequality chain. In particular, , and . By induction on we have . Next, we shall show that . Suppose that and let S be a -set that does not contain . Then is a PDS of T contradicting . Hence . Suppose that and let S be an almost PDS of such that Clearly, and has no neighbor in S. It follows that is a PDS of T of size a contradiction. Thus . Next we show that . Let f be a -function such that . To Roman dominate , we must have either or . We claim that . Suppose, to the contrary, that . By definition of perfect Roman dominating functions, we may assume that . But then the function defined by and otherwise, is a PRDF of of weight contradicting . Hence . It follows that the function f restricted to is a PRDF of of weight at most for which we conclude from that and . Hence to Roman dominate , we must have and thus function f restricted to is a -function that assigns a a 2 to Hence , and thus . Therefore, since it can be obtained from by Operation
- (e.4.)
- and has a child z with depth 0.Seeing the above Cases and Subcases as we did in the beginning of Case (e), we may assume that any child of is a leaf, or an end strong support vertex of degree 3, or a vertex with depth 2 whose maximal subtree is isomorphic to , or a vertex with depth 3 whose maximal subtree is isomorphic to . Assume first that , and let . Clearly, belongs to any -set and such a set -set can be extended to a PDS of T by adding implying that . Next we show that . Let f be a -function such that . Clearly and . If or , then the function f restricted to is a PRDF on yielding . Hence assume that and . Then the function defined by and otherwise, is a PRDF of yielding . By induction on it follows thatFor the next, we assume that . If then it can be seen that T is a tree with and so Hence we assume that Consider the following situations.
- (e.4.1.)
- .Let . If then T is a tree with and yielding Hence, assume that is nontrivial. For a -set S, let if and if . Then is a PDS of implying that . Moreover, it is easy to see that . By induction on we obtain .
- (e.4.3.)
- and has a child with depth 3.Then and are isomorphic. If u is a vertex in , then let be the vertex of corresponding to u in . Let . Clearly, any -set can be extended to a PDS of T by adding and thus . Moreover, it is not hard to see that By induction on we obtain .
- (e.4.4.)
- and has a children y with depth 1 and degree 3.Let . Clearly, any -set can be extended to a PDS of T by adding and thus . Next, we show that . Let f be a -function such that and (by Proposition 1). Clearly and . If , then the function f restricted to is a PRDF on yielding . Thus, let . Then to Roman dominate , we must have . Then the function defined by and otherwise, is a PRDF on yielding . It follows from the induction hypothesis that
- (e.4.5.)
- and has a child with depth 2 such that .If u is a vertex in , then let be the vertex of corresponding to u in . Let . Clearly, any -set can be extended to a PDS of T by adding and so . Moreover, it is not hard to see that By the induction hypothesis we obtain
- (e.4.6.)
- and has a children with depth 0.If then T is a tree with and yielding Hence we assume that Suppose first that and let . If then T is a tree with and yielding Hence assume that is nontrivial. Clearly, any -set can be extended to a PDS of T by adding and thus . On the other hand, it is not hard to see that . By the induction hypothesis we obtain .Assume now that . By above Cases and Subcases, we may assume that any child of is a leaf, or a vertex with depth j whose maximal subtree is isomorphic to for . Let be a tree obtained from T by removing and joining to . Clearly, any -set contains and such a set can be extended to a PDS of T by yielding . Now, let f be a -function, and let . To Roman dominate the vertices , we must have when or when . If or and , then the function f restricted to is a PRDF on implying that . Hence assume that and . Then the function defined by and otherwise, is a PRDF on yielding . By the induction hypothesis we obtainand the proof is complete.□
According to Lemma 2 and Theorem 2, we have proven Theorem 1.
Author Contributions
Z.S. and S.M.S. contribute for supervision, methodology, validation, project administration and formal analyzing. S.K., M.C., M.S. contribute for investigation, resources, some computations and wrote the initial draft of the paper which were investigated and approved by Z.S. and M.C. wrote the final draft. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the National Key R & D Program of China (Grant No. 2019YFA0706402) and the Natural Science Foundation of Guangdong Province under grant 2018A0303130115.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Livingston, M.; Stout, Q.F. Perfect dominating set. Congr. Numer. 1990, 79, 187–203. [Google Scholar]
- Chaluvaraju, B.; Chellali, M.; Vidya, K.A. Perfect k-domination in graphs. Australas. J. Comb. 2010, 48, 175–184. [Google Scholar]
- Cockayne, E.J.; Hartnell, B.L.; Hedetniemi, S.T.; Laskar, R. Perfect domination in graphs. J. Comb. Inform. System Sci. 1993, 18, 136–148. [Google Scholar]
- Dejter, I.J.; Pujol, J. Perfect Domination and Symmetry. Congr. Numer. 1995, 111, 18–32. [Google Scholar]
- Fellows, M.R.; Hoover, M.N. Perfect domination. Australas. J. Comb. 1991, 3, 141–150. [Google Scholar]
- Li, Z.; Shao, Z.; Rao, Y.; Wu, P.; Wang, S. The characterization of perfect Roman domination stable trees. arXiv 2018, arXiv:1806.03164. [Google Scholar]
- Cockayne, E.J.; Dreyer, P.A., Jr.; Hedetniemic, S.M.; Hedetniemic, S.T. Roman domination in graphs. Discrete Math. 2004, 278, 11–22. [Google Scholar] [CrossRef]
- Revelle, C.S.; Rosing, K.E. Defendens imperium romanum: A classical problem in military strategy. Am. Math. Monthly 2000, 107, 585–594. [Google Scholar] [CrossRef]
- Stewart, I. Defend the Roman Empire. Sci. Am. 1999, 281, 136–139. [Google Scholar] [CrossRef]
- Henning, M.A.; Klostermeyer, W.F.; MacGillivray, G. Perfect Roman domination in trees. Discrete Appl. Math. 2018, 236, 235–245. [Google Scholar] [CrossRef]
- Alhevaz, A.; Darkooti, M.; Rahbani, H.; Shang, Y. Strong equality of perfect Roman and weak Roman domination in trees. Mathematics 2019, 7, 997. [Google Scholar] [CrossRef]
- Chellali, M.; Sheikholeslami, S.M.; Soroudi, M. A characterization of perfect Roman trees. Discrete Appl. Math. 2020. submitted. [Google Scholar]
- Henning, M.A.; Klostermeyer, W.F. Perfect Roman domination in regular graphs. Appl. Anal. Discrete Math. 2018, 12, 143–152. [Google Scholar] [CrossRef]
- Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. Roman domination in graphs. In Topics in Domination in Graphs; Haynes, T.W., Hedetniemi, S.T., Henning, M.A., Eds.; Springer: Basel, Switzerland, 2020. [Google Scholar]
- Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. Varieties of Roman domination. In Structures of Domination in Graphs; Haynes, T.W., Hedetniemi, S.T., Henning, M.A., Eds.; 2020; to appear. [Google Scholar]
- Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. Varieties of Roman domination II. AKCE J. Graphs Comb. 2020. to appear. [Google Scholar]
- Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. A survey on Roman domination parameters in directed graphs. J. Combin. Math. Comb. Comput. 2020. to appear. [Google Scholar]
- Chellali, M.; Jafari Rad, N.; Sheikholeslami, S.M.; Volkmann, L. The Roman domatic problem in graphs and digraphs: A survey. Discuss. Math. Graph Theory 2020. [Google Scholar] [CrossRef]
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).