In this paper, we present the tight upper and lower bounds on vak≡(G) for an arbitrary graph G with n vertices and a given integer k with 1≤k≤n−1, and we ...
Bibliographic details on Nordhaus-Gaddum-Type Results for the Strong Equitable Vertex k-Arboricity of Graphs.
Feb 15, 2016 · we obtain the Nordhaus-Gaddum type results of strong equitable vertex k-arboricity for general k. 3. Page 4. 2 Results for some specific graphs.
(PDF) On the Equitable Vertex Arboricity of Graphs - ResearchGate
www.researchgate.net › ... › Graphs
Recently, Wu, Zhang and Li introduced the concept of equitable (t,k)-tree-coloring, which can be regarded as a generalization of proper equitable t-coloring.
In the end, we obtain the Nordhaus-Gaddum type results of strong equitable vertex $k$-arboricity for general $k$. Publication: arXiv e-prints. Pub Date: May ...
Among such graphs, K 3 -free graphs (also known as triangle free graphs) are the most studied. The degree (valency) of a vertex v ∈ V is the number ...
Missing: Equitable | Show results with:Equitable
The equitable vertex k-arboricity of a graph G, denoted by va = k (G), is the minimum number of induced forests into which G can be equitably partitioned, where ...
May 31, 2023 · Nordhaus–Gaddum-Type Results for the Strong Equitable Vertex k-Arboricity of Graphs ... results, we further obtain the Nordhaus–Gaddum-type ...
A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper.
Missing: Strong Arboricity
Nordhaus-Gaddum-Type Results for the Strong Equitable Vertex k-Arboricity of Graphs. ... Nordhaus-Gaddum-Type Results for the k-Independent Number of Graphs.