Results 41 to 50 of about 26,105 (190)
Weakened Gallai-Ramsey numbers [PDF]
In the Ramsey theory of graphs, one seeks to determine the value of the Ramsey number rt(n), defined to be the least natural number p such that every coloring of the edges of Kp using t colors results in a monochromatic copy of Kn in some color.
Gabrielle Beam, Mark Budden
doaj
Rainbow connection number of generalized composition
Let be a connected graph with . The rainbow connection number is the smallest for which there is a map such that any two vertices can be connected by a path whose edge colors are all distinct.
Fendy Septyanto, Kiki Ariyanti Sugeng
doaj +1 more source
Computing Correlation among the Graphs under Lexicographic Product via Zagreb Indices
A topological index (TI) is a numerical descriptor of a molecule structure or graph that predicts its different physical, biological, and chemical properties in a theoretical way avoiding the difficult and costly procedures of chemical labs.
Muhammad Javaid +3 more
doaj +1 more source
New concepts on level graphs of vague graphs with application in medicine
Vague graphs (VGs), belonging to the fuzzy graph (FG) family, have good capabilities when facing problems that cannot be expressed by FGs. When an element membership is unclear, neutrality is a good option that can be well-supported by a VG. The previous
Xiaolong Shi +3 more
doaj +1 more source
Hamiltonian decomposition of lexicographic product
AbstractIn this paper we prove the conjecture of J.-C. Bermond (Ann. Discrete Math. 36 (1978), 21–28): If two graphs are decomposable into Hamiltonian cycles, then their lexicographic product is decomposable, too.
Baranyai, Z, Szász, Gy.R
openaire +2 more sources
Abstract Based on an analysis of the Old Literary Tibetan corpus—a corpus of the oldest documented Tibetic language—the present study provides evidence that literary Tibetan v3 verb stems (commonly termed ‘future’) initially encoded passive voice. New arguments put forward in this article range from Trans‐Himalayan nominal morphology to early Tibetan ...
Joanna Bialek
wiley +1 more source
Broadcast domination of lexicographic and modular products of graphs
A dominating broadcast labeling of a graph G is a function [Formula: see text] such that [Formula: see text] for all [Formula: see text] where e(v) is the eccentricity of v, and for every vertex [Formula: see text] there exists a vertex v with [Formula ...
Jishnu Sen, Srinivasa Rao Kola
doaj +1 more source
Comparative Study of Generalized Sum Graphs via Degree-Based Topological Indices
In theoretical chemistry, topological indices (TIs) have important role to predict various physical and structural properties of the study under molecular graphs.
Muhammad Javaid +2 more
doaj +1 more source
On the weak Roman domination number of lexicographic product graphs
A vertex $v$ of a graph $G=(V,E)$ is said to be undefended with respect to a function $f: V \longrightarrow \{0,1,2\}$ if $f(v)=0$ and $f(u)=0$ for every vertex $u$ adjacent to $v$.
Pérez-Rosés, Hebert +2 more
core +1 more source
Abstract Participants in Russia's 1825 Decembrist uprising against the Tsarist regime were, quite literally, a case study in French cultural influence upon Russia. This is particularly true as it relates to Russia's emotional cultures. Although this has not, traditionally, been the primary focus of historical analysis of this event (in Soviet or ...
ADAM COKER
wiley +1 more source

