Results 31 to 40 of about 9,407,399 (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
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
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
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
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
Note on the smallest root of the independence polynomial [PDF]
, 2013 One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k).
Csíkvári, Péter
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan +3 more
wiley +1 more source
City of Independence transportation system plan [PDF]
, 2007 246 pp. Bookmarks supplied by UO. Includes maps and figures. Published June, 2007. Captured February 1, 2008.The Independence Transportation System Plan (TSP) establishes the City’s goals, policies and action strategies for developing and improving the ...
Independence (Or.), Parametrix, Inc.
core +1 more source