minimum tenacity of toroidal graphs

اسناد مشابه

• Minimum Tenacity of Toroidal graphs

  مقاله۲۰۱۶Journal of Algorithms and ComputationHamid Doost Hosseini

  The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G

• Some Results on Tenacity of Graphs∗

  سند علمی۲۰۱۲Fengwei Li

  The tenacity of an incomplete connected graph G is defined as T (G) = min{ |S|+m(G−S) ω(G−S) : S ⊂ V (G), ω(G− S) > 1}, where ω(G− S) and m(G− S), respectively, denote the number of components and the order of a largest component inG−S. This is a reasonable parameter to measure t

• On the Edge-Tenacity of Graphs

  سند علمی۲۰۰۸Dara Moazzami, Behzad Salehian, B. Salehian

  The edge-tenacity Te(G) of a graph G was defined as Te(G) = min F⊂E(G) {| F | +τ(G− F ) ω(G− F ) } where the minimum is taken over all edge cutset F of G. We define G-F to be the graph induced by the edges of E(G) − F , τ(G − F ) is the number of edges in the largest component of

• Decomposing toroidal graphs into circuits and edges

  سند علمی۲۰۰۵Discrete Applied MathematicsBaogang Xu, Lusheng Wang

  Erdős et al. (Canad. J. Math. 18 (1966) 106–112) conjecture that there exists a constant dce such that every simple graph on n vertices can be decomposed into at most dcen circuits and edges. We consider toroidal graphs, where the graphs can be embedded on the torus, and give a p

• Vertex arboricity of toroidal graphs with a forbidden cycle

  سند علمی۲۰۱۴Discrete MathematicsIlkyoo Choi, Haihui Zhang

  The vertex arboricity a(G) of a graph G is the minimum k such that V (G) can be partitioned into k sets where each set induces a forest. For a planar graph G, it is known that a(G) ≤ 3. In two recent papers, it was proved that planar graphs without k-cycles for some k ∈ {3, 4, 5,

• Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles

  سند علمی۲۰۱۷J. Comb. Optim.Tao Wang

  A total coloring of a graph G is an assignment of colors to the vertices and the edges of G such that every pair of adjacent/incident elements receive distinct colors. The total chromatic number of a graph G, denoted by χ′′(G), is the minimum number of colors needed in a total co