Results 91 to 100 of about 2,666,039 (345)
Unique-Maximum Coloring Of Plane Graphs
A unique-maximum k-coloring with respect to faces of a plane graph G is a coloring with colors 1, . . . , k so that, for each face of G, the maximum color occurs exactly once on the vertices of α.
Fabrici Igor, Göring Frank
doaj +1 more source
New Results of Face Labeling for Some Plane Graphs
A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that ...
Nabila Hameed +4 more
doaj +1 more source
Non‐thermal plasma treatment of melanoma cells induced epithelial‐mesenchymal transition (EMT) in a dose‐dependent fashion. This report highlights the critical need to further investigate potential adverse effects of non‐thermal plasma for cancer therapy and to optimize treatment parameters for clinical translation. Despite the promising results of non‐
Eline Biscop +10 more
wiley +1 more source
3D Visibility Representations of 1-planar Graphs
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities
A Arleo +20 more
core +1 more source
Plane graphs and link invariants
This paper is a survey of some new results and problems concerning the relationship between knot-theoretic meaning and purely combinatorial form.
openaire +3 more sources
Trastuzumab‐deruxtecan, a HER2‐targeting antibody‐drug conjugate, shows promising antitumor activity in head and neck squamous cell carcinoma with low HER2 expression. In vitro and in vivo studies demonstrated dose‐dependent cell death and tumor growth reduction in low HER2‐expressing cell lines, which correlated with drug accumulation measured using a
Abdullah Bin Naveed +8 more
wiley +1 more source
On d-antimagic labelings of plane graphs
The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face.
Martin Baca +4 more
doaj +1 more source
On Face Irregular Evaluations of Plane Graphs
We investigate face irregular labelings of plane graphs and we introduce new graph characteristics, namely face irregularity strength of type (α,β,γ). We obtain some estimation on these parameters and determine the precise values for certain families of ...
Bača Martin +3 more
doaj +1 more source
Graph States, Pivot Minor, and Universality of (X,Z)-measurements [PDF]
The graph state formalism offers strong connections between quantum information processing and graph theory. Exploring these connections, first we show that any graph is a pivot-minor of a planar graph, and even a pivot minor of a triangular grid.
Mhalla, Mehdi, Perdrix, Simon
core +1 more source
Vertex coloring of plane graphs with nonrepetitive boundary paths
A sequence $s_1,s_2,...,s_k,s_1,s_2,...,s_k$ is a repetition. A sequence $S$ is nonrepetitive, if no subsequence of consecutive terms of $S$ form a repetition. Let $G$ be a vertex colored graph.
Alon +12 more
core +1 more source

