• 제목/요약/키워드: Graph Labeling

검색결과 73건 처리시간 0.027초

TOTAL MEAN CORDIAL LABELING OF SOME CYCLE RELATED GRAPHS

  • Ponraj, R.;Narayanan, S. Sathish
    • Journal of applied mathematics & informatics
    • /
    • 제33권1_2호
    • /
    • pp.101-110
    • /
    • 2015
  • A Total Mean Cordial labeling of a graph G = (V, E) is a function $f:V(G){\rightarrow}\{0,1,2\}$ such that $f(xy)={\Large\lceil}\frac{f(x)+f(y)}{2}{\Large\rceil}$ where $x,y{\in}V(G)$, $xy{\in}E(G)$, and the total number of 0, 1 and 2 are balanced. That is ${\mid}ev_f(i)-ev_f(j){\mid}{\leq}1$, $i,j{\in}\{0,1,2\}$ where $ev_f(x)$ denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). If there is a total mean cordial labeling on a graph G, then we will call G is Total Mean Cordial. Here, We investigate the Total Mean Cordial labeling behaviour of prism, gear, helms.

이항트리에서 2-에지번호매김 방법에 대한 연구 (The Research of the 2-Edge Labeling Methods on Binomial Trees)

  • 김용석
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제4권2호
    • /
    • pp.37-40
    • /
    • 2015
  • 본 논문에서는 이항트리의 2-에지번호매김에서 선형적 에지번호매김 방법, 변형된 에지번호매김 방법 그리고 혼합형 에지번호매김 방법들을 제안한다. 이러한 연구결과는 최대 연결도를 갖는 신뢰성이 높은 상호연결망의 일종인 원형군 그래프(circulant graph)의 점프열(jump sequence)로 에지번호들을 사용하면 이항트리를 스패닝 트리로 갖고 최적방송이 가능한 다양한 위상들을 설계할 수 있다.

THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE

  • Kim, Byeong Moon;Song, Byung Chul;Rho, Yoomi
    • Korean Journal of Mathematics
    • /
    • 제21권2호
    • /
    • pp.151-159
    • /
    • 2013
  • An $L(j,k)$-labeling of a graph G is a vertex labeling such that the difference of the labels of any adjacent vertices is at least $j$ and that of any vertices of distance two is at least $k$ for given $j$ and $k$. The minimum span of all L(2, 1)-labelings of G is called the ${\lambda}$-number of G and is denoted by ${\lambda}(G)$. In this paper, we find a lower bound of the ${\lambda}$-number of the Cartesian product $K_m{\Box}C_n$ of the complete graph $K_m$ of order $m$ and the cycle $C_n$ of order $n$. In fact, we show that when $n{\geq}3$, ${\lambda}(K_4{\Box}C_n){\geq}7$ and the equality holds if and only if n is a multiple of 8. Moreover when $m{\geq}5$, ${\lambda}(K_m{\Box}C_n){\geq}2m-1$ and the equality holds if and only if $n$ is even.

이항트리에서 S-에지번호 매김 (The S-Edge Numbering on Binomial trees)

  • 김용석
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 하계종합학술대회 논문집(1)
    • /
    • pp.167-170
    • /
    • 2004
  • We present a novel graph labeling problem called S-edge labeling. The constraint in this labeling is placed on the allowable edge label which is the difference between the labels of endvertices of an edge. Each edge label should be ${ a_n / a_n = 4 a_{n-l}+l,\;a_{n-1}=0}$. We show that every binomial tree is possible S-edge labeling by giving labeling schems to them. The labelings on the binomial trees are applied to their embedings into interconnection networks.

  • PDF

The Fibonacci Edge Labeling on Fibonacci Trees

  • Kim, yong-Seok
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -2
    • /
    • pp.731-734
    • /
    • 2000
  • We present a novel graph labeling problem called Fibonacci edge labeling. The constraint in this labeling is placed on the allowable edge label which is the difference between the labels of endvertices of an edge. Each edge label should be (3m+2)-th Fibonacci numbers. We show that every Fibonacci tree can be labeled Fibonacci edge labeling. The labelings on the Fibonacci trees are applied to their embeddings into Fibonacci Circulants.

  • PDF

Automated Segmentation of the Lateral Ventricle Based on Graph Cuts Algorithm and Morphological Operations

  • Park, Seongbeom;Yoon, Uicheul
    • 대한의용생체공학회:의공학회지
    • /
    • 제38권2호
    • /
    • pp.82-88
    • /
    • 2017
  • Enlargement of the lateral ventricles have been identified as a surrogate marker of neurological disorders. Quantitative measure of the lateral ventricle from MRI would enable earlier and more accurate clinical diagnosis in monitoring disease progression. Even though it requires an automated or semi-automated segmentation method for objective quantification, it is difficult to define lateral ventricles due to insufficient contrast and brightness of structural imaging. In this study, we proposed a fully automated lateral ventricle segmentation method based on a graph cuts algorithm combined with atlas-based segmentation and connected component labeling. Initially, initial seeds for graph cuts were defined by atlas-based segmentation (ATS). They were adjusted by partial volume images in order to provide accurate a priori information on graph cuts. A graph cuts algorithm is to finds a global minimum of energy with minimum cut/maximum flow algorithm function on graph. In addition, connected component labeling used to remove false ventricle regions. The proposed method was validated with the well-known tools using the dice similarity index, recall and precision values. The proposed method was significantly higher dice similarity index ($0.860{\pm}0.036$, p < 0.001) and recall ($0.833{\pm}0.037$, p < 0.001) compared with other tools. Therefore, the proposed method yielded a robust and reliable segmentation result.

ON 4-TOTAL MEAN CORDIAL GRAPHS

  • PONRAJ, R.;SUBBULAKSHMI, S.;SOMASUNDARAM, S.
    • Journal of applied mathematics & informatics
    • /
    • 제39권3_4호
    • /
    • pp.497-506
    • /
    • 2021
  • Let G be a graph. Let f : V (G) → {0, 1, …, k - 1} be a function where k ∈ ℕ and k > 1. For each edge uv, assign the label $f(uv)={\lceil}{\frac{f(u)+f(v)}{2}}{\rceil}$. f is called k-total mean cordial labeling of G if ${\mid}t_{mf}(i)-t_{mf}(j){\mid}{\leq}1$, for all i, j ∈ {0, 1, …, k - 1}, where tmf (x) denotes the total number of vertices and edges labelled with x, x ∈ {0, 1, …, k-1}. A graph with admit a k-total mean cordial labeling is called k-total mean cordial graph.

RDF 접근 제어에서 소수 그래프 레이블링을 사용한 효율적 권한 충돌 발견 (Efficient Authorization Conflict Detection Using Prime Number Graph Labeling in RDF Access Control)

  • 김재훈;박석
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제35권2호
    • /
    • pp.112-124
    • /
    • 2008
  • RDF와 OWL은 시맨틱 웹을 위한 두 가지 핵심 기반 기술이다. 이러한 RDF와 OWL을 이용하는, 또한 이에 관련된 많은 연구들이 최근 소개되었다. 하지만, RDF와 OWL에 대한 정보 보안 관련 연구는 미비한 실정이다. 본 논문에서는 RDF 보안 기술과 관련하여, RDF 트리플에 기반을 둔 안전한 접근제어 명세 모델을 간단히 소개한다. 다음으로 RDF 접근 제어 명세 시의 추론에 의한 권한 충돌을 효율적으로 발견하기 위하여 소수 그래프 레이블링을 기법을 활용하는 방법을 자세히 소개한다. 추론에 의한 접근 권한 충돌 문제는 비록 하위 개념에 대한 접근 권한이 허용이지만, 하위 개념은 상위 개념으로 추론될 수 있으므로, 만약 상위 개념에 대한 접근 권한이 불허로 되어 있는 경우 하위 개념 또한 허용되어서는 안 되는 문제이다. 몇 가지 실험에서는 제안하는 소수 그래프 레이블링을 사용하는 방법이 기존의 단순한 권한 충돌 발견 방법보다 현저히 나은 성능을 가짐을 보여 준다.

H-V -SUPER MAGIC DECOMPOSITION OF COMPLETE BIPARTITE GRAPHS

  • KUMAR, SOLOMON STALIN;MARIMUTHU, GURUSAMY THEVAR
    • 대한수학회논문집
    • /
    • 제30권3호
    • /
    • pp.313-325
    • /
    • 2015
  • An H-magic labeling in a H-decomposable graph G is a bijection $f:V(G){\cup}E(G){\rightarrow}\{1,2,{\cdots},p+q\}$ such that for every copy H in the decomposition, $\sum{_{{\upsilon}{\in}V(H)}}\;f(v)+\sum{_{e{\in}E(H)}}\;f(e)$ is constant. f is said to be H-V -super magic if f(V(G))={1,2,...,p}. In this paper, we prove that complete bipartite graphs $K_{n,n}$ are H-V -super magic decomposable where $$H{\sim_=}K_{1,n}$$ with $n{\geq}1$.

DISTINGUISHING NUMBER AND DISTINGUISHING INDEX OF STRONG PRODUCT OF TWO GRAPHS

  • Alikhani, Saeid;Soltani, Samaneh
    • 호남수학학술지
    • /
    • 제42권4호
    • /
    • pp.645-651
    • /
    • 2020
  • The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. The strong product G ☒ H of two graphs G and H is the graph with vertex set V (G) × V (H) and edge set {{(x1, x2),(y1, y2)}|xiyi ∈ E(Gi) or xi = yi for each 1 ≤ i ≤ 2.}. In this paper we study the distinguishing number and the distinguishing index of strong product of two graphs. We prove that for every k ≥ 2, the k-th strong power of a connected S-thin graph G has distinguishing index equal two.