Results 71 to 80 of about 152,670 (312)
Geodesic Dominated Coloring of Graphs
IEEE AccessIn this paper, we introduce geodesic dominated coloring, a novel variant of dominated coloring in graphs, where each color class is dominated by at least one geodesic.
M. Paruvatha Vathana, R. Jayagopal
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2019 We define an almost-injective coloring as a coloring of the vertices of a graph such that every closed neighborhood has exactly one duplicate. That is, every vertex has either exactly one neighbor with the same color as it, or exactly two neighbors of ...
Goddard Wayne +2 more
doaj +1 more source
The NP-completeness of authomorphic colorings
Discussiones Mathematicae Graph Theory, 2010 Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such that each automorphism of the graph preserves the coloring. The automorphic chromatic index (number) is the least integer k for which G admits an automorphic edge(vertex)coloring with k colors.
openaire +3 more sources
Tensor completion algorithm-aided structural color design
Optics Express, 2023 In recent years, structural color has developed rapidly due to its distinct advantages, such as low loss, high spatial resolution and environmental friendliness. Various inverse design methods have been extensively investigated to efficiently design optical structures.
Xueling Wei +11 more
openaire +2 more sources
Molecular Oncology, EarlyView.In this exploratory study, we investigated the relationship between the gut microbiota and outcome in patients with metastatic hormone receptor‐positive breast cancer, treated in a randomized clinical trial with chemotherapy alone or chemotherapy in combination with immune checkpoint blockade.
Andreas Ullern +7 more
wiley +1 more source
Completing Partial Proper Colorings using Hall's Condition [PDF]
The Electronic Journal of Combinatorics, 2015 In the context of list-coloring the vertices of a graph, Hall's condition is a generalization of Hall's Marriage Theorem and is necessary (but not sufficient) for a graph to admit a proper list-coloring. The graph $G$ with list assignment $L$ satisfies Hall's condition if for each subgraph $H$ of $G$, the inequality $|V(H)| \leq \sum_{\sigma \in ...
Holliday, Sarah +2 more
openaire +2 more sources
Molecular Oncology, EarlyView.Following high dose rate brachytherapy (HDR‐BT) for hepatocellular carcinoma (HCC), patients were classified as responders and nonresponders. Post‐therapy serum induced increased BrdU incorporation and Cyclin E expression of Huh7 and HepG2 cells in nonresponders, but decreased levels in responders.
Lukas Salvermoser +14 more
wiley +1 more source
Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem
IEEE AccessMany important science and engineering problems can be converted into NP-complete problems which are of significant importance in computer science and mathematics.
Junpeng Zhan
doaj +1 more source
Hardness Results for Total Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2016 A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G, denoted by trc(G), is the smallest number of colors that are needed in a total-coloring of G ...
Chen Lily, Huo Bofeng, Ma Yingbin
doaj +1 more source
A synthetic benzoxazine dimer derivative targets c‐Myc to inhibit colorectal cancer progression
Molecular Oncology, EarlyView.Benzoxazine dimer derivatives bind to the bHLH‐LZ region of c‐Myc, disrupting c‐Myc/MAX complexes, which are evaluated from SAR analysis. This increases ubiquitination and reduces cellular c‐Myc. Impairing DNA repair mechanisms is shown through proteomic analysis.
Nicharat Sriratanasak +8 more
wiley +1 more source