نتایج جستجو برای: total k

تعداد نتایج: 1151194  

Journal: :Discrete Mathematics 2015
Vadim E. Zverovich

We consider two general frameworks for multiple domination, which are called 〈r, s〉-domination and parametric domination. They generalise and unify {k}-domination, k-domination, total k-domination and k-tuple domination. In this paper, known upper bounds for the classical domination are generalised for the 〈r, s〉-domination and parametric domination numbers. These generalisations are based on t...

A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

Journal: :iranian journal of mathematical chemistry 0
b basavanagoud karnatak university dharwad s. patil karnatak university v r desai karnatak university m tavakoli ferdowsi university of mashhad a r ashrafi university of kashan

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

2009
Tsai-Lien Wong Daqing Yang Xuding Zhu

A graph G = (V, E) is (k, k′)-total weight choosable if the following is true: For any (k, k′)-total list assignment L that assigns to each vertex v a set L(v) of k real numbers as permissible weights, and assigns to each edge e a set L(e) of k′ real numbers as permissible weights, there is a proper L-total weighting, i.e., a mapping f : V ∪ E → R such that f(y) ∈ L(y) for each y ∈ V ∪ E, and f...

Ahmet Duran Hakkı Gökbel Mehmet Hamurcu Mehmet Musa Özcan, Mustafa Çelik Nurhan Uslu Tijana Demiral

The mineral contents of Centaura leave and seeds were determined by Inductively Coupled Plasma-Atomic Emission Spectroscopy (ICP-AES). Macro element concentrations (P, K, Ca, Mg and S) of samples were found at high levels. K was established at high level in both leave and seed samples of Centaurea. While K contents of leaves changes between 7254.10 mg/kg (Centaurea lycaonica) and 26396.36 m...

The aim of this study is to provide necessary information on the biology of mosquitofish in Seyhan Dam Lake in Adana, which is located in southern part of Turkey. The population structure of eastern mosquitofish Gambusia holbrooki Girard, 1859 was studied in Seyhan Dam Lake. A total of 1582 specimens (772 males and 810 females) were collected monthly from January to December, 2007. The age comp...

Journal: :CoRR 2017
P. Sharifani M. R. Hooshmandasl

A subset S ⊆ V in a graph G = (V,E) is called a [1, k]-set, if for every vertex v ∈ V \ S, 1 ≤ |NG(v)∩S| ≤ k. The [1, k]-domination number of G, denoted by γ[1,k](G) is the size of the smallest [1, k]-sets of G. A set S′ ⊆ V (G) is called a total [1, k]-set, if for every vertex v ∈ V , 1 ≤ |NG(v) ∩ S| ≤ k. If a graph G has at least one total [1, k]-set then the cardinality of the smallest such ...

Journal: :IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society 1999
Francesc J. Ferri Jesús V. Albert Enrique Vidal

The edited nearest neighbor classification rules constitute a valid alternative to k-NN rules and other nonparametric classifiers. Experimental results with synthetic and real data from various domains and from different researchers and practitioners suggest that some editing algorithms (especially, the optimal ones) are very sensitive to the total number of prototypes considered. This paper in...

2011
K. Prasanna Surya Narayana

Cluster analysis is one of the prominent techniques in the field of data mining and k-means is one of the most well known popular and partitioned based clustering algorithms. K-means clustering algorithm is widely used in clustering. The performance of k-means algorithm will affect when clustering the continuous data. In this paper, a novel approach for performing k-means clustering on continuo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید