近畿大学学術情報リポジトリ

It is also known that every internally triconnected plane graph has a grid drawing of size (n − 1) × (n − 2) in which all inner facial cycles are drawn as convex polygons although

There is also a graph with 7 vertices, 10 edges, minimum degree 2, maximum degree 4 with domination number 3..

We then prove the existence of a long exact sequence involving the cohomology groups of a k-graph and a crossed product graph.. We finish with recalling the twisted k-graph C

We can formulate this as an extremal result in two ways: First, for every graph G, among all bipartite graphs with a given number of edges, it is the graph consisting of disjoint

We note that in the case m = 1, the class K 1,n (D) properly contains the classical Kato class K n (D) introduced in [1] as the natural class of singular functions which replaces the

Given T and G as in Theorem 1.5, the authors of [2] first prepared T and G as follows: T is folded such that it looks like a bi-polar tree, namely, a tree having two vertices

In this paper we describe quantum automorphism groups of vertex-transitive graphs having n ≤ 11 vertices, with one graph omitted.. This enhances previous classification work from

We also recall that a circular space is a complete graph with at least three vertices, viewed as a geometry of rank 2 with vertices and edges as points and lines, respectively.. In