Results 81 to 90 of about 1,309,904 (175)
, 2011 A graph that has a Smarandachely vertex-mean k-labeling is called Smarandachely k vertex-mean graph or Smarandachely k V -mean graph. Particularly, if k = 0, such a Smarandachely vertex-mean 0-labeling and Smarandachely 0 vertex-mean graph or ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
Rainbow Connection Number Pada Operasi Graf [PDF]
, 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
On rainbow vertex antimagic coloring and its application to the encryption keystream construction [PDF]
Let G = (V,E) be a graph that is a simple, connected and un-directed graph. We now introduce a new notion of rainbow vertex antimagic coloring. This is a proper development of antimagic labeling with rainbow vertex coloring.
Nagaraja, Vaishnavi +6 more
core +1 more source
The n-queens completion problem. [PDF]
Res Math Sci, 2022 Glock S, Munhá Correia D, Sudakov B.
europepmc +1 more source
Relative timing information and orthology in evolutionary scenarios. [PDF]
Algorithms Mol Biol, 2023 Schaller D +5 more
europepmc +1 more source
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
Gallai-Ramsey and vertex proper connection numbers [PDF]
, 2015 Given a complete graph G, we consider two separate scenarios. First, we consider the minimum number N such that every coloring of G using exactly k colors contains either a rainbow triangle or a monochromatic star on t vertices.
Emily C. Chizmar, Chizmar, Emily C
core
Automorphisms and twisted vertex operators [PDF]
, 1987 This work is an examination of various aspects of twisted vertex operator representations of Kac-Moody algebras. It starts with an introduction to Kac-Moody algebras and string theories, including a discussion of the propagation of strings on orbifolds ...
Myhill, R.G, Myhill, Richard Graham
core
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
Rainbow K-Connection In Dense Graphs
, 2011 An edge-colouring of a graph G is rainbow k-connected if, for any two vertices of G , there are k internally vertex-disjoint paths joining them, each of which is rainbow (i.e., all edges of each path have distinct colours).
Liu, Henry +5 more
core +1 more source