Results 41 to 50 of about 978,459 (257)
Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]
Jisuanji gongcheng, 2017 To solve the problem of Smarandachely Adjacent Vertex Distinguishing Edge Coloring(SAVDEC) of graphs,this paper presents a coloring algorithm based on multi-objective optimization.For each sub problem,the sub objective function vector and decision space ...
CAO Daotong,LI Jingwen,WEN Fei
doaj +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
On Mf-Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2022 An edge coloring φ of a graph G is called an Mf-edge coloring if | φ(v)| ≤ f(v) for every vertex v of G, where φ(v) is the set of colors of edges incident with v and f is a function which assigns a positive integer f(v) to each vertex v.
Ivančo Jaroslav, Onderko Alfréd
doaj +1 more source
Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Discussiones Mathematicae Graph Theory, 2013 An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each ...
Czap Július, Tuza Zsolt
doaj +1 more source
Researches on the coloring of multigraphs [PDF]
Given a loopless multigraph $G$ and a vertex-function $f\ : \ V(G) \rightarrow \mathbb{N}\backslash \{0\}$, an {\bf $f$-(edge)-coloring} of $G$ is an assignment of colors to the edges of $G$ such that each color appears at each vertex $v\in V(G)$ at most
Hao, Yanli
core +1 more source
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
Referral Patterns and Diagnostic Timeliness in Pediatric Cancer: A Hospital‐Based Study in Indonesia
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Timely diagnosis and treatment are critical for improving survival among children with cancer. In low‐ and middle‐income countries (LMICs), delays are common and may be influenced by fragmented referral pathways and diagnostic limitations.
Nur Melani Sari +5 more
wiley +1 more source
Edge-Coloring Problems for Graphs [PDF]
, 2010 application/pdfThe edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks.
Nishizeki, Takao, Nakano, Shin-ichi
core
An Introduction to Fuzzy Edge Coloring [PDF]
, 2016 In this paper, a new concept of fuzzy edge coloring is introduced. The fuzzy edge coloring is an assignment of colors to edges of a fuzzy graph G. It is proper if no two strong adjacent edges of G will receive the same color.
K.S, Kanzul Fathima, Hussain R, Jahir
core +1 more source
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source