نتایج جستجو برای: complementary graph
تعداد نتایج: 298002 فیلتر نتایج به سال:
A d-graph G = (V ; E1, . . . , Ed) is a complete graph whose edges are arbitrarily partitioned into d subsets (colored with d colors); G is a Gallai d-graph if it contains no three-colored triangle ∆; furthermore, G is a CIS d-graph if ⋂d i=1 Si 6= ∅ for every set-family S = {Si | i ∈ [d]}, where Si ⊆ V is a maximal independent set of Gi = (V,Ei), the ith chromatic component of G, for all i ∈ [...
given a non-abelian finite group $g$, let $pi(g)$ denote the set of prime divisors of the order of $g$ and denote by $z(g)$ the center of $g$. thetextit{ prime graph} of $g$ is the graph with vertex set $pi(g)$ where two distinct primes $p$ and $q$ are joined by an edge if and only if $g$ contains an element of order $pq$ and the textit{non-commuting graph} of $g$ is the graph with the vertex s...
A generic de.nition of fuzzy morphism between graphs (GFM) is introduced that includes classical graph related problem de.nitions as sub-cases (such as graph and subgraph isomorphism). The GFM uses a pair of fuzzy relations, one on the vertices and one on the edges. Each relation is a mapping between the elements of two graphs. These two fuzzy relations are linked with constraints derived from ...
let $g$ be a non-abelian finite group. in this paper, we prove that $gamma(g)$ is $k_4$-free if and only if $g cong a times p$, where $a$ is an abelian group, $p$ is a $2$-group and $g/z(g) cong mathbb{ z}_2 times mathbb{z}_2$. also, we show that $gamma(g)$ is $k_{1,3}$-free if and only if $g cong {mathbb{s}}_3,~d_8$ or $q_8$.
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
In this paper we give new bounds on the bisection width of random 3-regular graphs $n$ vertices. The main contribution is a lower bound $0.103295n$ based first moment method together with structural analysis graph, thereby improving 27-year-old result Kostochka and Melnikov. We also complementary upper $0.139822n$ by combining Lyons original combinatorial insights. Developping approach further,...
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
a signed graph (marked graph) is an ordered pair $s=(g,sigma)$$(s=(g,mu))$, where $g=(v,e)$ is a graph called the underlyinggraph of $s$ and $sigma:erightarrow{+,-}$$(mu:vrightarrow{+,-})$ is a function. for a graph $g$, $v(g),e(g)$ and $c(g)$ denote its vertex set, edge set and cut-vertexset, respectively. the lict graph $l_{c}(g)$ of a graph $g=(v,e)$is defined as the graph having vertex set ...
backgroundfor using of complementary and alternative medicine methods (cam) in the leukemia pediatrics than other types of cancer, we have two great challenges; first challenge is their safety and risks and second challenge is study gaps in this field. regarding to these challenges, this study is a narrative review of some cam methods in the leukemia pediatrics from the perspective of their saf...
background and purpose: inappropriate complementary feeding practices are one of the causes of malnutrition worldwide. this study was aimed to determine the complementary feeding practices according to world health organization recommendation in sari, iran. materials and methods: this cross-sectional study on complementary feeding practices assayed the different aspect of infant feeding based o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید