• Journal of applied mathematics & informatics
• /
• 제26권3_4호
• /
• pp.531-540
• /
• 2008

We discuss the decomposition problems on circuit graphs and triangular graphs, and show how they can be applied to obtain results on spanning trees or hamiltonian cycles. We also prove that every circuit graph containing no separating 3-cycles can be extended by adding new edges to a triangular graph containing no separating 3-cycles.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.83-93
• /
• 2006

A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper, by characterizing the circuit graphs and investigating the structure of LV-graphs, we extend his result to 3-connected infinite locally finite VAP-free plane graphs.

• Korean Journal of Mathematics
• /
• 제28권1호
• /
• pp.123-136
• /
• 2020

In this paper, we give an explicit formula as a rational function for the Ihara zeta function of every finite connected graph without degree one vertices whose circuit rank is two.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.537-543
• /
• 2005

A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper Sallee's result is extended to 3-connected infinite locally finite VAP-free plane graphs containing no unbounded faces.

• 전자공학회논문지A
• /
• 제33A권10호
• /
• pp.195-204
• /
• 1996

We suggest a transform method form asynchronous finite state machines (AFSMs) into signal transition graphs (STGs) for speed-independent circuit synthesis. Existing works synthesize nodes in the state graph increases exponentially as the number of input and output signals increases. To overcome the problem of the exponential data complexity, we transform AFSMs into STGs so that the previous synthesis algorihtm form STGs can be applied.Accoridng to the experimental results, it turns out that our synthesis method produces more efficient circuit than the previous synthesis methods.

• 대한수학회지
• /
• 제49권3호
• /
• pp.493-502
• /
• 2012

In this article, we give a characterization theorem for a class of corank-1 Butler groups of the form $\mathcal{G}$($A_1$, ${\ldots}$, $A_n$). In particular, two groups $G$ and $H$ are quasi-isomorphic if and only if there is a label-preserving bijection ${\phi}$ from the edges of $T$ to the edges of $U$ such that $S$ is a circuit in T if and only if ${\phi}(S)$ is a circuit in $U$, where $T$, $U$ are quasi-representing graphs for $G$, $H$ respectively.

• 대한수학회논문집
• /
• 제19권3호
• /
• pp.577-584
• /
• 2004

In a 4-valent multi 3-gon graph, every cut-through curve forms a simple closed circuit. Hence it is a weak arrangement of simple curves that is defined by Branko Grunbaum. In this paper, we study the edge properties of the 4-valent multi 3-gon graphs from the point of view of arrangement, and we show that they are 3 colorable.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제13권2호
• /
• pp.6-10
• /
• 1974

We consider 'ordinary' graphs: that is, finite undirected graphs with no loops or multiple edges. An intersection representation of a graph G is a function r from V(G), the set of vertices of G, into a family of sets S such that distinct points $\chi$$_{\alpha}$ and $\chi$$_{\beta}$/ of V(G) are. neighbors in G precisely when ${\gamma}$($\chi$$_{\alpha}$)∩${\gamma}$($\chi$$_{\beta}$/)$\neq$ø, A graph G is a rigid circuit grouph if every cycle in G has at least one triangular chord in G. In this paper we consider the main theorem; A graph G has an intersection representation by arcs on an acyclic graph if and only if is a normal rigid circuit graph.uit graph.d circuit graph.uit graph.

• 전기전자학회논문지
• /
• 제8권1호
• /
• pp.22-32
• /
• 2004

본 논문에서는 Honghai Jiang에 의해 제안된 OVAG(Output value array graphs)를 기초로 MOVAG(Multi output value array graphs)를 이용한 다치논리함수의 구성방법을 제안하였다. D.M.Miller에 의해 제안된 MDD(Multiple-valued Decision Diagram)는 주어진 다변수의 함수에서 회로 설계까지 많은 처리시간과 노력이 요구되므로 본 논문에서는 MDD의 단점을 보완하여 데이터 처리시간의 단축과 적은 복잡도를 갖도록 MOVAG를 설계하였다. 또한 MOVAG의 구성 알고리즘과 입력행렬선정 알고리즘을 제안하고 T-gate를 사용하여 다치 논리 회로를 설계, 모의 실험을 통해 그 결과를 검증하였다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.1402-1405
• /
• 1993

In this paper, a fault evaluation method is proposed, which is to determine whether analog electronic circuits are faulty or not. In our method, evaluation characteristics of an expert test engineer are defined by means of directed graphs. By performing a multi-stage fuzzy inference based on the graphs, novice test engineers can derive a fault evaluation result satisfied by the expert. The effectiveness of our method is checked by some experiments for an amplifier circuit.