نتایج جستجو برای: partial fuzzy subgraph

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

Abolfazl Tehranian, Reza Taheri

Let $R$ be a commutative ring with identity and $mathbb{A}(R)$ be the set   of ideals of $R$ with non-zero annihilators. In this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_P(R)$. It is a (undirected) graph with vertices $mathbb{A}_P(R)=mathbb{A}(R)cap mathbb{P}(R)setminus {(0)}$, where   $mathbb{P}(R)$ is...

2008
Yanghua Xiao Wentao Wu Wei Wang Zhenying He

Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks. In the study of graph based data management, node disjoint subgraph homeomorphism relation between graphs is more suitable than (sub)graph isomorphism in many cases, especially in those cases that node skipping and node mismatching are al...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده علوم 1392

سازند پابده در برش دره شهر شامل 260متر شیل، شیل آهکی، مارن و آهک می باشد. مطالعات انجام شده بر روی فرامینیفرهای پلانکتون منجر به شناسایی و ارائه تعداد 12 بیوزون شده است. این بیوزون ها عبارتند از: بیوزون شماره یک: parasubbotina pseudobulloides partial-range zone ، بیوزون شماره دو: subbotina triloculinoides partial-range zone، بیوزون شماره سه: morozovella angulata partial-range zone ، بیوزون شمار...

Hoang Viet Long Ngo Van Hoa Nguyen Thi Kim Son

In this paper, we consider fuzzy fractional partial differential equations under Caputo generalized Hukuhara differentiability. Some new results on the existence and uniqueness of two types of fuzzy solutions are studied via  weakly contractive mapping in the partially ordered metric space. Some application examples are presented to illustrate our main results.

2008
Yanghua Xiao Wentao Wu Wei Wang Zhengying He

Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks. In the study of graph based data management, node disjoint subgraph homeomorphism relation between graphs is more suitable than (sub)graph isomorphism in many cases, especially in those cases that node skipping and node mismatching are al...

2014
George A. Anastassiou Martin Bohner Ravi P. Agarwal

This article studies the determination of the rate of convergence to the unit of each of three newly introduced here multivariate fuzzy perturbed normalized neural network operators of one hidden layer. These are given through the multivariate fuzzy modulus of continuity of the involved multivariate fuzzy number valued function or its high order fuzzy partial derivatives and that appears in the...

2013
Reza Ezzati Maryam Bagherian

In this paper, we prove a general form of a fixed point theorem with contractive-like mapping defined by altering function. We also present its application on study of existence and uniqueness of solution of fuzzy initial value problems in fuzzy partial metric spaces. In order to do this, we recall some fixed point theorems in partial metric spaces either crisp or fuzzy and use these theorems t...

Journal: :international journal of industrial engineering and productional research- 0
navid khademi département economie-gestion, ecole normale supérieure de cachan, france afshin shariat mohaymany iran university of science and technology jalil shahi iran university of science and technology mojtaba rajabi iran university of science and technology

most of the researches in the domain of fuzzy number comparisons serve the fuzzy number ordering purpose. for making a comparison between two fuzzy numbers, beyond the determination of their order, it is needed to derive the magnitude of their order. in line with this idea, the concept of inequality is no longer crisp however it becomes fuzzy in the sense of representing partial belonging or de...

1994
Robert Cimikowski

We present branch-and-bound algorithms for nding a maximum planar subgraph of a nonplanar graph. The problem has important applications in circuit layout, automated graph drawing, and facility layout. The algorithms described utilize heuristics to obtain an initial lower bound for the size of a maximum planar subgraph, then apply a sequence of fast preliminary tests for planarity to eliminate i...

Journal: :Ars Comb. 2006
Flavia Bonomo Guillermo Durán Marina Groshaus Jayme Luiz Szwarcfiter

A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph H of G. When equality holds for every clique subgraph of G, the graph is c–clique-perfect. A graph G is K-perfect when its clique graph K(G) is perfect. In this work, relations are described among the classes of perfec...

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

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