Results 21 to 30 of about 34,319 (321)

Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights [PDF]

Discrete Mathematics & Theoretical Computer Science, 2016
Let $G$ be a graph and $\mathcal{S}$ be a subset of $Z$. A vertex-coloring $\mathcal{S}$-edge-weighting of $G$ is an assignment of weights by the elements of $\mathcal{S}$ to each edge of $G$ so that adjacent vertices have different sums of incident ...
Hongliang Lu
doaj   +1 more source

AVD proper edge-coloring of some families of graphs

International Journal of Mathematics for Industry, 2021
Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj   +1 more source

The majority coloring of the join and Cartesian product of some digraph [PDF]

MATEC Web of Conferences, 2022
A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree.
Shi Mei, Xia Weihao, Xiao Mingyue, Wang Jihui   +3 more
doaj   +1 more source

Vertex-vertex color energy of a graph

Sibirskie Elektronnye Matematicheskie Izvestiya, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sayinath, Udupa, Bhat, R. S.
openaire   +1 more source

Vertex-Coloring with Defects

Journal of Graph Algorithms and Applications, 2017
Defective coloring is a variant of the traditional vertex-coloring in which adjacent vertices are allowed to have the same color, as long as the induced monochromatic components have a certain structure. Due to its important applications, as for example in the bipartisation of graphs, this type of coloring has been extensively studied, mainly with ...
Angelini, Patrizio, Bekos, Michael A., De Luca, Felice, Didimo, Walter, Kaufmann, Michael, Kobourov, Stephen, Montecchiani, Fabrizio, Raftopoulou, Chrysanthi N., Roselli, Vincenzo, Symvonis, Antonios   +9 more
openaire   +2 more sources

On b-vertex and b-edge critical graphs [PDF]

Opuscula Mathematica, 2015
A \(b\)-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the \(b\)-chromatic number \(b(G)\) of a graph \(G\) is the largest integer \(k\) such that \(G ...
Noureddine Ikhlef Eschouf, Mostafa Blidia   +1 more
doaj   +1 more source

Pewarnaan Titik Ketakteraturan Lokal pada Hasil Operasi Amalgamasi Titik Graf Lintasan

Contemporary Mathematics and Applications (ConMathA), 2023
Definition of graph is set pair (𔑉(𔐺),𔐸(𔐺)) where 𔑉(𔐺) is vertex set and 𔐸(𔐺) is edge set. A maping 𔐼 : 𔑉(𔐺)→{1,2, ... ,𔑘} as label function and weight function 𔑤 : 𔑉(𔐺)→𔑁 is desined as 𔑤(𔑢)=Σ𔑣
Rafelita Faradila Sandi, Arika Indah Kristiana, Lioni Anka Monalisa, Slamin, Robiatul Adawiyah   +4 more
doaj   +1 more source

Covering complete partite hypergraphs by monochromatic components [PDF]

, 2016
A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\'arf\'as: if the edges of a complete graph K are colored with ...
Gyárfás, András, Király, Zoltán
core   +2 more sources

Linear colorings of subcubic graphs [PDF]

, 2013
A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths.
Liu, Chun-Hung, Yu, Gexin
core   +3 more sources

Total Global Dominator Coloring of Trees and Unicyclic Graphs

مجلة بغداد للعلوم, 2023
          A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class.
Chithra K. P., Joseph Mayamma
doaj   +1 more source