Chordal cubic systems

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

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

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

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

منابع مشابه

Quick sampling method for cubic Bezier curves by chordal error

-In this paper, we will present a simple and quick sampling method to digitize the cubic Bezier curves via controlled the chordal error. Key-Words: sampling method, chordal error, cubic Bezier curve

متن کامل

Chordal Graphs

One can prove the following propositions: (1) For every non zero natural number n holds n − 1 is a natural number and 1 ≤ n. (2) For every odd natural number n holds n − 1 is a natural number and 1 ≤ n. (3) For all odd integers n, m such that n < m holds n ≤ m − 2. (4) For all odd integers n, m such that m < n holds m + 2 ≤ n. (5) For every odd natural number n such that 1 6= n there exists an ...

متن کامل

Chordal Rings Based on Symmetric Odd-Radix Number Systems

An n-node network, with nodes numbered from – n/2 to n/2 – 1, is a chordal ring network with the chord lengths 1 = s0, s1, . . . , sk–1 (2 ≤ si < n/2) when each node i (– n/2 ≤ i < n/2) is connected to each of the 2k nodes i ± si mod n (0 ≤ i < k) via an undirected link, where “mod” represents symmetric residues. We study a class of chordal ring networks in which the chord length si is ...

متن کامل

Chordal Digraphs

Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed graphs. Several structural properties of chordal graphs that are crucial for algorithmic applications carry over to the directed setting, including notions like simplicial vertices, perfect elimination orderings, and ch...

متن کامل

Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone

A graph class is sandwich monotone if, for every pair of its graphs G1 = (V,E1) and G2 = (V,E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \E1 such that G = (V,E1 ∪ {e1, . . . , ei}) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakon...

متن کامل

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


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

ژورنال

عنوان ژورنال: Publicacions Matemàtiques

سال: 1989

ISSN: 0214-1493

DOI: 10.5565/publmat_33289_07