نتایج جستجو برای: vertex equitable labeling
تعداد نتایج: 104456 فیلتر نتایج به سال:
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1. A d-degenerate graph is a graph G in which every subgraph has a vertex with degree at most d. A star Sm with m rays is an example of a 1-degenerate graph with maximum degree m that needs at least 1 + m/2 colors for an equitable coloring. Our main result is that every n-...
let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$. a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$. in this paper we introduce a new kind of graph energy for the binary labeled graph, the labeled graph energy $e_{l}(g)$. it depends on the underlying graph $g$...
Let be a graph. If , G V E is a function from the vertex set V G to the set of positive integers. Then two vertices are G , u v V -equitable if 1 u v . By the degree, equitable adjacency between vertices can be redefine almost all of the variants of the graphs. In this paper we study the degree equitability of the graph by defining equitable connectivity, equ...
I.Cahit introduced cordial graphs as a weaker version of graceful and harmonious graphs. The total product cordial labeling is a variant of cordial labeling. In this paper we introduce a vertex analogue product cordial labeling as a variant of total product cordial labeling and name it as total vertex product cordial labeling. Finally, we investigate total vertex product cordial labeling for ma...
Let G1 be a planar graph such that all cycles of length at most 4 are independent and let G2 be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of G1 and G2 can be equitably partitioned into t subsets for every t ≥ 3 so that each subset induces a forest. These results partially confirm a conjecture of Wu, Zhang
The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al. [1] introduced the Minimum Reload Cost Cycle Cover problem, which is to find a set of vertex-disjoint cycles spanning all vertices with minimum reload cost. They proved that this problem is strongly NP-hard and not appro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید