Results 31 to 40 of about 1,999,234 (282)
On θ-commutators and the corresponding non-commuting graphs
Open Mathematics, 2017 The θ-commutators of elements of a group with respect to an automorphism are introduced and their properties are investigated. Also, corresponding to θ-commutators, we define the θ-non-commuting graphs of groups and study their correlations with other ...
Shalchi S., Erfanian A., Farrokhi DG M.
doaj +1 more source
ON THE GIRTH, INDEPENDENCE NUMBER, AND WIENER INDEX OF COPRIME GRAPH OF DIHEDRAL GROUP
Barekeng, 2023 The coprime graph of a finite group , denoted by , is a graph with vertex set such that two distinct vertices and are adjacent if and only if their orders are coprime, i.e., where |x| is the order of x.
Agista Surya Bawana +2 more
doaj +1 more source
When can statistical theories be causally closed? [PDF]
, 2004 The notion of common cause closedness of a classical, Kolmogorovian probability space with respect to a causal independence relation between the random events is defined, and propositions are presented that characterize common cause closedness for ...
Gyenis, Balázs, Rédei, Miklós
core +1 more source
Tree decompositions with bounded independence number: beyond independent sets
, 2022 We continue the study of graph classes in which the treewidth can only be large due to the presence of a large clique, and, more specifically, of graph classes with bounded tree-independence number. In [Dallard, Milanič, and Štorgel, Treewidth versus clique number. {II}.
Milanič, Martin, Rzążewski, Paweł
openaire +2 more sources
Rainbow Connection Number and Independence Number of a Graph [PDF]
Graphs and Combinatorics, 2016 14 ...
Dong, Jiuying, Li, Xueliang
openaire +3 more sources
The possibilities of an independent special rapporteur scheme [PDF]
, 2011 The independence and impartiality of the special rapporteurs is undoubtedly one of considerable importance to their work. In the context of the special procedures operating under the auspices of the Human Rights Council, a number of questions arise: what
Smith, Rhona
core +2 more sources
Independence Numbers of Planar Contact Graphs [PDF]
Discrete & Computational Geometry, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Bounds for the Independence Number in $k$-Step Hamiltonian Graphs [PDF]
Computer Science Journal of Moldova, 2018 For a given integer $k$, a graph $G$ of order $n$ is called $k$-step Hamiltonian if there is a labeling $v_1,v_2,...,v_n$ of vertices of $G$ such that $d(v_1,v_n)=d(v_i,v_{i+1})=k$ for $i=1,2,...,n-1$.
Noor A'lawiah Abd Aziz +3 more
doaj
Abstract Interactions and Interaction Refinement in Model-Driven Design [PDF]
, 2005 In a model-driven design process the interaction between application parts can be described at various levels of platform-independence. At the lowest level of platform-independence, interaction is realized by interaction mechanisms provided by specific ...
Almeida, João Paulo +4 more
core +4 more sources
Two sufficient conditions for fractional k-deleted graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2012 Let G be a graph, and k a positive integer. A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k.
Lv Xiangyang
doaj +1 more source