Results 31 to 40 of about 9,781,779 (300)
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
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
Parameters of the coprime graph of a group [PDF]
International Journal of Group Theory, 2021 There are many different graphs one can associate to a group. Some examples are the well-known Cayley graph, the zero divisor graph (of a ring), the power graph, and the recently introduced coprime graph of a group.
Jessie Hamm, Alan Way
doaj +1 more source
The independent resolving number of a graph [PDF]
Mathematica Bohemica, 2003 Summary: For an ordered set \(W = \{w_1, w_2, \dots , w_k\}\) of vertices in a connected graph \(G\) and a vertex \(v\) of \(G\), the code of \(v\) with respect to \(W\) is the \(k\)-vector \[ c_W (v) = (d (v, w_1), d (v, w_2), \dots , d (v, w_k)). \] The set \(W\) is an independent resolving set for \(G\) if (1) \(W\) is independent in \(G\) and (2 ...
Chartrand, G. +2 more
openaire +2 more sources
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
On the Independence Number of Traceable 2-Connected Claw-Free Graphs
Discussiones Mathematicae Graph Theory, 2019 A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable.
Wang Shipeng, Xiong Liming
doaj +1 more source
The critical independence number and an independence decomposition
European Journal of Combinatorics, 2011 10 pages, 4 ...
openaire +3 more sources
Independence number in graphs and its upper bounds [PDF]
Journal of Mahani Mathematical ResearchIn this paper, we use the double counting method to find some upper bounds for the independence number of a simple graph in terms of its order, size and maximum degree. Moreover, we determine extremal graphs attaining equality in upper bounds.
Farzad Shaveisi
doaj +1 more source
Independence Notice of Adopted Amendment (2006-12-14) [PDF]
, 2006 22 pp. Adopted 2006-12-14. Department of Land Conservation and Development Notice of Adopted AmendmentLegislative amendments to the City of Independence Development Code to update the Flood Plain Overlay Zone (Sub Chapter 51).
Independence (Or.)
core +1 more source
On the Number of Independent Functional Dependencies [PDF]
, 2006 We will investigate the following question: what can be the maximum number of independent functional dependencies in a database of n attributes, that is the maximum cardinality of a system of dependencies which which do not follow from the Armstrong axioms and none of them can be derived from the remaining ones using the Armstrong axioms.
János Demetrovics +3 more
openaire +2 more sources