نتایج جستجو برای: bond graphs

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

2010
Dean C. Karnopp Donald L. Margolis Ronald C. Rosenberg Amalendu Mukherjee Arun Kumar Ranjit Karmakar

Donald L. Margolis, Ronald C. Rosenberg, Wiley, 2012, 111816007X, 9781118160077, 648 pages. An expanded new edition of the bestselling system dynamics book using the bond graph approachA major revision of the go-to resource for engineers facing the increasingly complex job of dynamic systems design, System Dynamics, Fifth Edition adds a completely new section on the control of mechatronic syste...

Journal: :transactions on combinatorics 2016
chandrashekar adiga b‎. ‎r‎. ‎rakshith

‎in this paper we introduce mixed unitary cayley graph $m_{n}$‎ ‎$(n>1)$ and compute its eigenvalues‎. ‎we also compute the energy of‎ ‎$m_{n}$ for some $n$‎.

Journal: :Theor. Comput. Sci. 2001
Sergei L. Bezrukov Robert Elsässer

We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best poss...

Journal: :Theor. Comput. Sci. 2000
Bruno Courcelle

We introduce nite relational structures called sketches, that represent edge crossings in drawings of nite graphs. We consider the problem of characterizing sketches in Monadic Second-Order logic. We answer positively the question for framed sketches, i.e., for those representing drawings of graphs consisting of a planar connected spanning subgraph (the frame) augmented with additional edges th...

Journal: :Discrete Applied Mathematics 2017
Jennifer Diemunsch Nathan Graber Lucas Kramer Victor Larsen Lauren M. Nelsen Luke L. Nelsen Devon Sigler Derrick Stolee Charlie Suer

Let c : E(G) → [k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let c̄(v) = (a1, . . . , ak), where ai is the number of edges incident to v with color i. Reorder c̄(v) for every v in G in nonincreasing order to obtain c∗(v), the color-blind partition of v. When c∗ induces a proper vertex coloring, that is, c∗(u) 6= c∗(v) for every edge uv in G, we say that c is col...

2015
Zijun Wang

This paper implements an emerging data-driven method of directed acyclic graphs to study the contemporaneous causal structure among the federal funds rate and U.S. Treasury bond yields of various maturities. Using high frequency daily data from 1994 to 2009, we find that innovations in the two-year Treasury bond yield play a central role. They contemporaneously cause most other bond yields. The...

2007
Christophe Texier

We consider a metric graph G made of two graphs G1 and G2 attached at one point. We derive a formula relating the spectral determinant of the Laplace operator SG(γ) = det(γ−∆) in terms of the spectral determinants of the two subgraphs. The result is generalized to describe the attachment of n graphs. The formulae are also valid for the spectral determinant of the Schrödinger operator det(γ −∆+ ...

Journal: :J. Graph Algorithms Appl. 2009
Michael Jünger Michael Schulz

We examine the simultaneous embedding with fixed edges problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a simultaneous embedding with fixed edges for (G1, G2). More formally, we define the subset ISEFE of all planar graphs as follows: A graph S lies in ISEFE if every pa...

Journal: :Theor. Comput. Sci. 1999
Bruno Courcelle

We prove that the unique decomposition of connected graphs defined by Tutte is definable by formulas of Monadic Second-Order Logic. This decomposition has two levels: every connected graph is a tree of "2-connected components" called blocks ; every 2-connected graph is a tree of so-called 3-blocks. Our proof uses 2dags which are certain acyclic orientations of the considered graphs. We obtain a...

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

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