نتایج جستجو برای: graph design

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

1995
Jeffrey L. Stein Loucas S. Louca

Previous research has developed search algorithms for deducing Proper Models of dynamic systems. These minimum complexity models (with physically meaningful parameters) can reduce the design cycle where modeling and simulation is (or should be) a part of the design process. To apply these algorithms effectively to realistic systems, a Component Modeling Procedure consisting of a two-level repre...

Journal: :SIAM J. Discrete Math. 2000
Chính T. Hoàng Van Bang Le

A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which induces a split graph. We show that the strong perfect graph conjecture is true for 2-split graphs and we design a polynomial algorithm to recognize a perfect 2-split graph.

Journal: :iranian journal of mathematical chemistry 2014
ivan gutman

altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. we now provide a generalization of the altan concept, applicable to any graph. several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. among these ar...

Journal: :journal of algorithms and computation 0
p. jeyanthi govindammal aditanar college for women tiruchendur-628 215, tamil nadu, india t. saratha devi department of mathematics, g.venkataswamy naidu college, kovilpatti-628502,tamilnadu,india.

let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defi ned by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...

2014
S. K. Abdul Rahim

This paper proposes the design of Star Schema of a Data Warehouse and conversion to its equivalent Graph based Multi Dimensional Data Model (GMDDM Model). Design of Star Schema facilitates in constructing Graph based Multi Dimensional Data Model. The GMDDM model defines a set of graph based constructs that are used to specify the conceptual level design of Data Warehouse. Data warehouse represe...

ژورنال: کنترل 2022

 In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...

1994
Ashim Garg Roberto Tamassia

Graph drawing addresses the problem of constructing geometric representations of abstract graphs and networks. It is an emerging area of research that combines avors of topological graph theory and computational geometry. The automatic generation of drawings of graphs has important applications in key computer technologies such as software engineering, database design, visual interfaces, and co...

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

the main objective in sampling is to select a sample from a population in order to estimate some unknown population parameter, usually a total or a mean of some interesting variable. a simple way to take a sample of size n is to let all the possible samples have the same probability of being selected. this is called simple random sampling and then all units have the same probability of being ch...

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

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