Results 31 to 40 of about 3,916 (152)
Regular inference as vertex coloring
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Costa Florêncio, C., Verwer, S.
openaire +4 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 +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 +4 more
doaj +1 more source
Regular inference as vertex coloring [PDF]
, 2020 This paper is concerned with the problem of supervised learning of deterministic finite state automata, in the technical sense of identification in the limit from complete data, by finding a minimal DFA consistent with the data (regular inference).
$ Christophe +2 more
core +2 more sources
Edge-coloring vertex-weighting of graphs [PDF]
, 2021 Let G = (V (G),E(G)) be a simple, finite and undirected graph of order n. A k-vertex weighting of a graph G is a mapping w: V (G) → {1,…, k}. A k-vertex weighting induces an edge labeling fw: E(G) → N such that fw(uv) = w(u) + w(v).
Lau, Gee Choon +2 more
core +2 more sources
Conflict-Free Vertex Coloring Of Planar Graphs [PDF]
, 2017 The conflict-free coloring problem is a variation of the vertex coloring problem, a classical NP-hard optimization problem. The conflict-free coloring problem aims to color a possibly proper subset of vertices such that there is a unique color within the
Shawn Seymour, Seymour, Shawn
core +2 more sources
Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs [PDF]
, 2023 In this paper, we consider the adjacent vertex distinguishing proper edge coloring (for short, AVDPEC) and the adjacent vertex distinguishing total coloring (for short, AVDTC) of a fuzzy graph.
Chen Zhang, Zengtai Gong
core +1 more source
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
Single Valued Neutrosophic R-dynamic Vertex Coloring of Graphs [PDF]
Neutrosophic Sets and Systems, 2022 In 1998, Smarandache introduced the new theory - Neutrosophic sets. In order to achieve the best results in a current situation, policy makers must contend with uncertainty and unpredictability.
V. Aparna, N. Mohanapriya, Said Broumi
doaj +1 more source
Hierarchical and modularly-minimal vertex colorings
The Art of Discrete and Applied Mathematics, 2022 Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of colors $χ(G)$. We show that greedy colorings are a special case of the more general hierarchical vertex colorings, which recently were introduced in phylogenetic ...
Dulce I. Valdivia +4 more
openaire +3 more sources