Results 71 to 80 of about 543,681 (314)
Triangle-free induced subgraphs of the unitary polarity graph
Let $\perp$ be a unitary polarity of a finite projective plane $\pi$ of order $q^2$. The unitary polarity graph is the graph with vertex set the points of $\pi$ where two vertices $x$ and $y$ are adjacent if $x \in y^\perp$.
Mattheus, Sam, Pavese, Francesco
core +1 more source
Circulating tumor cells: advancing personalized therapy in small cell lung cancer patients
Small cell lung cancer (SCLC) is an aggressive form of lung cancer that spreads rapidly to secondary sites such as the brain and liver. Cancer cells circulating in the blood, “circulating tumor cells” (CTCs), have demonstrated prognostic value in SCLC, and evaluating biomarkers on CTCs could guide treatment decisions such as for PARP inhibitors ...
Prajwol Shrestha+6 more
wiley +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
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
Some Operations on Complex Fuzzy Graphs
In this paper we discussed about some types of complex fuzzy graphs which is the extension of fuzzy graph. As the membership value of elements of fuzzy graph is in between 0 and 1.
Azhagendran N, Mohamed Ismayil A
doaj +1 more source
Rook-Drawing for Plane Graphs [PDF]
Motivated by visualization of large graphs, we introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a
Auber, David+3 more
openaire +3 more sources
Cell‐free and extracellular vesicle microRNAs with clinical utility for solid tumors
Cell‐free microRNAs (cfmiRs) are small‐RNA circulating molecules detectable in almost all body biofluids. Innovative technologies have improved the application of cfmiRs to oncology, with a focus on clinical needs for different solid tumors, but with emphasis on diagnosis, prognosis, cancer recurrence, as well as treatment monitoring.
Yoshinori Hayashi+6 more
wiley +1 more source
Odd facial total-coloring of unicyclic plane graphs [PDF]
Július Czap
doaj +1 more source
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
No finite $5$-regular matchstick graph exists [PDF]
A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart.
Kurz, Sascha
core