Báo cáo toán học: "Recognizing Graph Theoretic Properties with Polynomial Ideals" pdf
Báo cáo toán học: "Recognizing Graph Theoretic Properties with Polynomial Ideals" pdf
... set for H
G,C
with C = {(1 , 2), (2, 3), ( 3 , 4), (4, 5 ), (5, 1)}.
Let G be an undirected graph with vertex set V and edge set E, and consider the
auxiliary directed graph
˜
G with vertices ... class of graphs with encodings that have degree o ne infeasibility certificates in-
cludes all graphs containing odd wheels as subgraphs (e.g., a 4-clique) [34].
Corollary 2.2. If a graph...
Báo cáo toán học: "A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture" pdf
... electronic journal of combinatorics 16 (2009), #R43 3
A graph- theoretic method for choosing a spanning set
for a finite-dimensional vector space, with applications
to the Grossman-Larson-Wright mo ... pattern with nonzero
diagonal entries. It is also well know n that a nonnegative square pattern matrix
with positive main diagonal is sign nonsingular if and only if its associated digr...
Báo cáo toán học: "Constructions for cubic graphs with large girth" pdf
... just three minimal graphs.
Girth 11 A graph with 112 vertices was published by Balaban [2] in 1973. It
was obtained by excising a tree with 14 vertices from the minimal graph with 126
vertices ... graph with 10 vertices and girth 5 – Petersen’s graph, which is also minimal. In
this case both graphs attain the very naive bound.
Example 4.4 When g = 8 the minimal cubic graph is...
Báo cáo toán học: " Structural and optical properties of ZnS thin films deposited by RF magnetron sputtering" potx
... structures with (111) preferential orientation, whereas the diffraction patterns sharpen with the increase in
substrate temperatures. The FESEM data also reveal that the films have nano-size grains with ... pre-sputtering for 10 min was per-
formed with an RF power of 120 W under pure argon gas
while the substrate was covered with a shield. During ZnS
film growth, argon gas with a...
Báo cáo toán học: " Structure and electrical properties of sputtered TiO2/ZrO2 bilayer composite dielectrics upon annealing in nitrogen" pdf
... Brener R, Saguy C:
The use of nanolaminates to obtain structurally stable high-K films with
superior electrical properties: HfNO-HfTiO. J Appl Phys 2008, 103:114106.
15. Cho YJ, Nguyen NV, Richter ... dielectric
properties in ZrTiO
4
thin films. Appl Phys Lett 2000, 76:3043.
22. Wang H, Wang Y, Feng J, Ye C, Wang BY, Wang HB, Li Q, Jiang Y,
Huang AP, Xiao ZS: Structure and electrical pr...
Báo cáo toán học: " Recognizing Group Languages with OBDDs" pptx
... consisting of a permutation π ∈ S
n
and a directed acyclic
graph. This graph has two nodes of outdegree 0, called the sinks and a specific
node with indegree 0 called the source. All other nodes are ... of finite non-abelian groups, see paragraph 3.2. We start with an
example.
3.1. An Example
We state a general condition under which the language associated with group is
nice. It applie...
Báo cáo toán học: "Constrained graph processes" ppsx
... there is a graph F ⊂ G
Q
(s − 1) ∪{e
s
} with
F ∈ M (Q
c
). But then F ⊂ G
0
(s) ⊂ G
0
(t), so e/∈ G
Q
(t).
In fact we shall not work with graph processes at all, but rather with a random graph ... and for Q = {triangle free graphs} the
answer to within a log n factor. Here we give answers within powers of log n for the cases of C
4
-free graphs
and K
4
-free graphs, using the ‘...
Báo cáo toán học: "Bound Graph Polysemy" ppt
... antichain on
V , so it is clear that no graph on V with at least one edge is bound polysemic with
G.
Theorem 10 No graph with more than one vertex is bound polysemic with its com-
plement.
Proof. Let ... 7 (2000), #R43 6
Corollary 9 Every edgeless graph is bound polysemic with itself but with no other
graph.
Proof. That G =(V, ∅) is bound polysemic with itself follows im...
Báo cáo toán học: "Recognizing circulant graphs of prime order in polynomial time" doc
... circulant graph G. G is a simple
undirected graph if 0 ∈ γ(0) and j ∈ γ(0) implies −j ∈ γ(0).
There are different equivalent characterizations of circulant graphs. One of them is
this: A graph G ... circulant
graph iff a cyclic permutation of its vertices exists which is an automorphism of G.
Cayley graphs, and in particular, circulant graphs have been studied intensively in
the litera...
Từ khóa: