We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt(G, x) = ∑in=yt(G) dr(G, i) x', where dr(G, i) is the cardinality of total dominating sets of...We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt(G, x) = ∑in=yt(G) dr(G, i) x', where dr(G, i) is the cardinality of total dominating sets of G of size i, and yt(G) is the total domination number of G. In [7] We have obtained some properties of Dt(G, x) and its coefficients. Also, we have calculated the total domination polynomials of complete graph, complete bipartite graph, join of two graphs and a graph consisting of disjoint components. In this paper, we presented for any two isomorphic graphs the total domination polynomials are same, but the converse is not true. Also, we proved that for any n vertex transitive graph of order n and for any v ∈ V(G), dt(G, i) = 7 dt(V)(G, i), 1 〈 i 〈 n. And, for any k-regular graph of order n, dr(G, i) = (7), i 〉 n-k and d,(G, n-k) = (kn) - n. We have calculated the total domination polynomial of Petersen graph D,(P, x) = 10X4 + 72x5 + 140x6 + 110x7 + 45x8 + [ 0x9 + x10. Also, for any two vertices u and v of a k-regular graph Hwith N(u) ≠ N(v) and if Dr(G, x) = Dt( H, x ), then G is also a k-regular graph.展开更多
A book embedding of a graph G consists of placing the vertices of G on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is a measure of the qual...A book embedding of a graph G consists of placing the vertices of G on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is a measure of the quality of a book embedding which is the minimum number of pages in which the graph G can be embedded. In this paper, the authors discuss the embedding of the generalized Petersen graph and determine that the page number of the generalized Petersen graph is three in some situations, which is best possible.展开更多
文摘We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt(G, x) = ∑in=yt(G) dr(G, i) x', where dr(G, i) is the cardinality of total dominating sets of G of size i, and yt(G) is the total domination number of G. In [7] We have obtained some properties of Dt(G, x) and its coefficients. Also, we have calculated the total domination polynomials of complete graph, complete bipartite graph, join of two graphs and a graph consisting of disjoint components. In this paper, we presented for any two isomorphic graphs the total domination polynomials are same, but the converse is not true. Also, we proved that for any n vertex transitive graph of order n and for any v ∈ V(G), dt(G, i) = 7 dt(V)(G, i), 1 〈 i 〈 n. And, for any k-regular graph of order n, dr(G, i) = (7), i 〉 n-k and d,(G, n-k) = (kn) - n. We have calculated the total domination polynomial of Petersen graph D,(P, x) = 10X4 + 72x5 + 140x6 + 110x7 + 45x8 + [ 0x9 + x10. Also, for any two vertices u and v of a k-regular graph Hwith N(u) ≠ N(v) and if Dr(G, x) = Dt( H, x ), then G is also a k-regular graph.
基金supported by the National Natural Science Foundation of China(Nos.11531010,11401510,11501487)the Key Laboratory Project of Xinjiang(No.2015KL019)the Doctoral Fund of Xinjiang University(No.BS150208)
文摘A book embedding of a graph G consists of placing the vertices of G on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is a measure of the quality of a book embedding which is the minimum number of pages in which the graph G can be embedded. In this paper, the authors discuss the embedding of the generalized Petersen graph and determine that the page number of the generalized Petersen graph is three in some situations, which is best possible.