• 제목/요약/키워드: maximal

검색결과 3,810건 처리시간 0.023초

CYCLIC SUBMODULES AND MODULES ASSOCIATED WITH THEM

  • Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • 제4권2호
    • /
    • pp.563-571
    • /
    • 1997
  • In this paper we define CR(completely reachable), MICR(minimal cyclic refinement)and MACR(maximal cyclic refinement)-Modules. We have obtained equivalent statements for minimal cyclic submodule and maximal cyclic submodule. Also we have obtained necessary and sufficient conditions for a module M with MICR to be cyclic or strongly cyclic.

ON THE TIGHTNESS CONDITIONS FOR MAXIMAL PLANAR GRAPHS

  • HWAN-OK JUNG
    • Journal of applied mathematics & informatics
    • /
    • 제4권1호
    • /
    • pp.235-242
    • /
    • 1997
  • We characterize the tight structure of a vertex-accumula-tion-free maximal planar graph with no separating triangles. Together with the result of Halin who gave an equivalent form for such graphs this yields that a tight structure always exists in every 4-connected maximal planar graph with one end.

ON MAXIMAL PRERADICAL RATIONAL EXTENSIONS

  • Cho, Yong-Uk
    • East Asian mathematical journal
    • /
    • 제19권2호
    • /
    • pp.251-259
    • /
    • 2003
  • The concepts of t-rational extensions and t-essential extensions of modules, where t a preradical for R-Mod, are introduced. The structures of such extensions are determined. Relations between maximal t-rational extensions and other concepts of modules are studied.

  • PDF

SECOND BEST TEMPORALLY REPEATED FLOWS

  • Eleonor, Ciurea
    • Journal of applied mathematics & informatics
    • /
    • 제9권1호
    • /
    • pp.77-86
    • /
    • 2002
  • Ford and Fulkerson have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optical dynamic flow. This paper presents an algorithm for second best temporal1y repeated flows. A numerical example is presented.