Pattern Formation over Multigraphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integral Cayley Multigraphs over Abelian and Hamiltonian Groups

It is shown that a Cayley multigraph over a group G with generating multiset S is integral (i.e., all of its eigenvalues are integers) if S lies in the integral cone over the boolean algebra generated by the normal subgroups of G. The converse holds in the case when G is abelian. This in particular gives an alternative, character-theoretic proof of a theorem of Bridges and Mena (1982). We exten...

متن کامل

Removable Circuits in Multigraphs

We prove the following conjecture of Bill Jackson ( J. London Math. Soc. (2) 21 (1980) p. 391). If G is a 2-connected multigraph with minimum degree at least 4 and containing no Petersen minor, then G contains a circuit C such that G E(C) is 2-connected. In fact, G has at least two edge-disjoint circuits which can serve as C. Until now, the conjecture had been veri ed only for planar graphs and...

متن کامل

Randomly Mt−decomposable Multigraphs and M2−equipackable Multigraphs

A graph G is called randomly H − decomposable if every maximal H − packing in G uses all edges in G. G is called H − equipackable if every maximal H − packing in G is also a maximum H − packing in G. M2 − decomposable graphs, randomly M2 − decomposable graphs and M2 − equipackable graphs have been characterized. The definitions could be generalized to multigraphs. And M2 − decomposable multigra...

متن کامل

Degree sequences of multigraphs

Let a, b and n be integers, n ≥ 1 and b ≥ a ≥ 0. Let an (a, b, n)-graph defined as a loopless graph G(a, b, n) on n vertices {V1, . . . , Vn}, in which Vi and Vj are connected with at least a and at most b (directed or undirected) edges. If G(a, b, n) is directed, then it is called (a, b, n)-digraph and if it is undirected, then it is called (a, b, n)undigraph. Landau in 1953 published an algor...

متن کامل

Nearest pattern interaction and global pattern formation

We studied the effect of nearest pattern interaction on a global pattern formation in a two-dimensional space, where patterns are to grow initially from a noise in the presence of a periodic supply of energy. Although our approach is general, we found that this study is relevant in particular to the pattern formation on a periodically vibrated granular layer, as it gives a unified perspective o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Network Science and Engineering

سال: 2018

ISSN: 2327-4697

DOI: 10.1109/tnse.2017.2730261