• Title, Summary, Keyword: Edge-transitive graph

Search Result 5, Processing Time 0.029 seconds

HEXAVALENT NORMAL EDGE-TRANSITIVE CAYLEY GRAPHS OF ORDER A PRODUCT OF THREE PRIMES

  • GHORBANI, MODJTABA;SONGHORI, MAHIN
    • Journal of applied mathematics & informatics
    • /
    • v.35 no.1_2
    • /
    • pp.83-93
    • /
    • 2017
  • The Cayley graph ${\Gamma}=Cay(G,S)$ is called normal edge-transitive if $N_A(R(G))$ acts transitively on the set of edges of ${\Gamma}$, where $A=Aut({\Gamma})$ and R(G) is the regular subgroup of A. In this paper, we determine all hexavalent normal edge-transitive Cayley graphs on groups of order pqr, where p > q > r > 2 are prime numbers.

SEMISYMMETRIC CUBIC GRAPHS OF ORDER 34p3

  • Darafsheh, Mohammad Reza;Shahsavaran, Mohsen
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.3
    • /
    • pp.739-750
    • /
    • 2020
  • A simple graph is called semisymmetric if it is regular and edge transitive but not vertex transitive. Let p be a prime. Folkman proved [J. Folkman, Regular line-symmetric graphs, Journal of Combinatorial Theory 3 (1967), no. 3, 215-232] that no semisymmetric graph of order 2p or 2p2 exists. In this paper an extension of his result in the case of cubic graphs of order 34p3, p ≠ 17, is obtained.

NORMAL EDGE-TRANSITIVE CIRCULANT GRAPHS

  • Sim, Hyo-Seob;Kim, Young-Won
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.2
    • /
    • pp.317-324
    • /
    • 2001
  • A Cayley graph of a finite group G is called normal edge-transitive if its automorphism group has a subgroup which both normalized G and acts transitively on edges. In this paper, we consider Cayley graphs of finite cyclic groups, namely, finite circulant graphs. We characterize the normal edge-transitive circulant graphs and determine the normal edge-transitive circulant graphs of prime power order in terms of lexicographic products.

  • PDF

Transitive Signature Schemes for Undirected Graphs from Lattices

  • Noh, Geontae;Jeong, Ik Rae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3316-3332
    • /
    • 2019
  • In a transitive signature scheme, a signer wants to authenticate edges in a dynamically growing and transitively closed graph. Using transitive signature schemes it is possible to authenticate an edge (i, k), if the signer has already authenticated two edges (i, j) and (j, k). That is, it is possible to make a signature on (i, k) using two signatures on (i, j) and (j, k). We propose the first transitive signature schemes for undirected graphs from lattices. Our first scheme is provably secure in the random oracle model and our second scheme is provably secure in the standard model.

Query Optimization Algorithm for Image Retrieval by Spatial Similarity) (위치 관계에 의한 영상 검색을 위한 질의 및 검색 기법)

  • Cho, Sue-Jin;Yoo, Suk-In
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.5
    • /
    • pp.551-562
    • /
    • 2000
  • Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

  • PDF