نتایج جستجو برای: graph design
تعداد نتایج: 1140992 فیلتر نتایج به سال:
Software engineering tools based on Graph Transformation techniques are becoming available, but their practical applicability is somewhat reduced by the lack of idioms and design patterns. Idioms and design patterns provide prototypical solutions for recurring design problems in software engineering, but their use can be easily extended into the graph transformation systems. In this paper we br...
Triple graph grammars, an extension of pair graph grammars, were introduced for the specification of graph translaters. We developed a framework which constitutes an industrial application of triple graph grammars. It solves integration problems in a specific domain, namely design processes in chemical engineering. Here, different design representations of a chemical plant have to be kept consi...
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.
the energy of a graph is equal to the sum of the absolute values of its eigenvalues. two graphs of the same order are said to be equienergetic if their energies are equal. we point out the following two open problems for equienergetic graphs. (1) although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید