APPROXIMATIONS OF REGULAR GRAPHS
نویسندگان
چکیده
The paper [11] raised the question of describing cardinality and types approximations for natural families theories. In present paper, a partial answer to this is given, study approximation topological properties classes theories also continued. We consider cycle graph consisting one or, in other words, certain number vertices (at least 3 if simple) connected into closed chain. It shown that an infinite approximated by finite graphs. Approximations regular graphs are considered. On hand, acyclic proved any pseudofinite. And also, k, k-regular homogeneous pseudofinite.Examples pseudofinite 3-regular 4-regular given.
منابع مشابه
D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملRegular Approximations through Labeled Bracketing
Regular approximations for context-free languages have a wide use as language models in natural language and speech processing. Since the famous work by Pereira and Wright (1991), several approximation methods have become available (cf. Nederhof 2000). However, there are further approximation methods for structured languages whose strings indicate the constituent structure by means of brackets....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ?azak?stan-Britan tehnikalyk? universitetìnìn? habaršysy
سال: 2022
ISSN: ['1998-6688']
DOI: https://doi.org/10.55452/1998-6688-2022-19-1-44-49