Results 61 to 70 of about 7,406 (155)
Schwinger-Dyson equations in QED and QCD the calculation of fermion-antifermion condensates [PDF]
, 2007 We present non-perturbative solutions for the fermion and boson propagators of QED in both three- and four-dimensions, and QCD. In doing so, we solve the coupled system of Schwinger-Dyson equations numerically in Euclidean space, investigating ...
Williams, Richard
core
The rainbow vertex-index of complementary graphs
, 2015 A vertex-colored graph $G$ is \emph{rainbow vertex-connected} if two vertices are connected by a path whose internal vertices have distinct colors. The \emph{rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest
Ye, Chengfu +3 more
core
The n-queens completion problem. [PDF]
Res Math Sci, 2022 Glock S, Munhá Correia D, Sudakov B.
europepmc +1 more source
Determining the Locating Rainbow Connection Number of Vertex-Transitive Graphs
The locating rainbow connection number of a graph is defined as the minimum number of colors required to color vertices such that every two vertices there exists a rainbow vertex path and every vertex has a distinct rainbow code.
Putri, Pritta Etriana +2 more
core
ANALISIS RAINBOW DAN STRONG RAINBOW VERTEX CONNECTION PADA GRAF HASIL OPERASI COMB SISI
, 2017 nilai Rainbow Vertex Connection dan Strong Rainbow Vertex Connection pada graf hasil operasi comb sisi (a) rvc(PnDBtm) = srvc(PnDBtm) = n−2 sisi x1x2 sebagai sisi cangkok pada graf Btm (b) rvc(PnDBtm) = srvc(PnDBtm) = n−1 sisi xiuj sebagai sisi ...
Muharromah, Agustina
core
Some results on the rainbow vertex-disconnection colorings of graphs
, 2023 Let $G$ be a nontrivial connected and vertex-colored graph. A vertex subset $X$ is called rainbow if any two vertices in $X$ have distinct colors. The graph $G$ is called \emph{rainbow vertex-disconnected} if for any two vertices $x$ and $y$ of $G ...
Weng, Yindi
core
Relative timing information and orthology in evolutionary scenarios. [PDF]
Algorithms Mol Biol, 2023 Schaller D +5 more
europepmc +1 more source
Rainbow Connection Number Pada Operasi Graf
, 2014 An edge-colouring of a graph $G$ is rainbow connected if there are $k$ internally vertex-disjoint paths joining them, with no two edges on the path have the same color.
Yulianti S, Arnasyitha, Dafik, Dafik
core
ANALISA RAINBOW CONNECTION DAN STRONG RAINBOW CONNECTION PADA GRAF HASIL OPERASI [PDF]
, 2016 Salah satu teori yang dikembangkan dalam teori graf adalah rainbow connection dan strong rainbow connection. Rainbow connection adalah pemberian warna pada sisi graf dengan syarat dua sisi yang bertetangga boleh diberi warna yang sama. Namun sisi yang
Hasan, Mokhamad Saiful
core +1 more source