منابع مشابه
Matching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملBond Graphs
The topic area that has become commonly known as ‘bond graph modeling and simulation’ should be separated into at the one hand the port-based approach to modeling and simulation and at the other hand the bond graph notation that is well suited to represent the port-concept. For this reason both the notation and the concepts directly related to the notation will be separated as much as possible ...
متن کاملBond Graphs III: Bond Graphs and Electrical Networks
Electrical networks are defined and a definition of when a bond graph and an electrical network are equivalent is given. Bond graphs and electrical networks are defined to be primitive if they contain no transformers or gyrators. A bond graph is defined to be realisable if it is equivalent to an electrical network and primitively realisable if it is equivalent to a primitive electrical network....
متن کاملBond System Security and Access Control Model
Bond is a message-oriented middleware for network computing on a grid of autonomous nodes. In this paper we overview the basic architecture of the Bond system and introduce the security model implemented in the Bond system. User programs as well as data are subject to the security constraints imposed by the local operating system. Bond objects are subject to the access control and the authentic...
متن کاملMatching in Gabriel Graphs
Given a set P of n points in the plane, the order-k Gabriel graph on P , denoted by k-GG, has an edge between two points p and q if and only if the closed disk with diameter pq contains at most k points of P , excluding p and q. We study matching problems in k-GG graphs. We show that a Euclidean bottleneck perfect matching of P is contained in 10-GG, but 8-GG may not have any Euclidean bottlene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling of Dynamical Systems
سال: 2006
ISSN: 1387-3954,1744-5051
DOI: 10.1080/13873950500068278