본문 바로가기
KERD
논문KCI 등재

Enumeration of optimally labelled graphs of bandwidth 2

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

An optimally labelled graph of bandwidth 2 is an ordered pair $(G, f)$ where $G$ is a simple graph with $bw(G)=2$ and $f : V(G) \rightarrow [n]$ is a bijection such that $bw(G, f)=2$. In this paper, the number of optimally labelled graphs of bandwidth two of order $n$ is enumerated by counting linear forests.

Abstract

An optimally labelled graph of bandwidth 2 is an ordered pair $(G, f)$ where $G$ is a simple graph with $bw(G)=2$ and $f : V(G) \rightarrow [n]$ is a bijection such that $bw(G, f)=2$. In this paper, the number of optimally labelled graphs of bandwidth two of order $n$ is enumerated by counting linear forests.

참고문헌 (3)

  1. A. Caprara, "On bandwidth-2 graphs", Discrete Appl. Math, 17(1-3), pp.1~13 (2002)
  2. G.-B. Chae, "Irreducible posets of linear discrepancy 1 and 2", Far East J. Math. Sci. (JMS), 22(2), pp.217~226 (2006)
  3. G.-B. Chae, "Graph bandwidth with irreducibility", ~

관련 논문AI추천

이 간행물의 다른 논문 (24건)