淡江大學機構典藏:Item 987654321/109344
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62819/95882 (66%)
Visitors : 4003753      Online Users : 693
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/109344


    Title: EXTREME MONOPHONIC GRAPHS AND EXTREME GEODESIC GRAPHS
    Authors: Titus, P.;Santhakumaran, A.P
    Keywords: geodetic number;monophonic number;extreme order;extreme geodesic graph;extreme monophonic graph
    Date: 2016-12
    Issue Date: 2017-01-17 09:14:33 (UTC+8)
    Publisher: 淡江大學出版中心
    Abstract: For a connected graph G=(V,E)G=(V,E) of order at least two, a chord of a path PP is an edge joining two non-adjacent vertices of PP. A path PP is called a monophonic path if it is a chordless path. A monophonic set of GG is a set SS of vertices such that every vertex of GG lies on a monophonic path joining some pair of vertices in SS. The monophonic number of GG is the minimum cardinality of its monophonic sets and is denoted by m(G)m(G). A geodetic set of GG is a set SS of vertices such that every vertex of GG lies on a geodesic joining some pair of vertices in SS. The geodetic number of GG is the minimum cardinality of its geodetic sets and is denoted by g(G)g(G). The number of extreme vertices in GG is its extreme order ex(G)ex(G). A graph GG is an extreme monophonic graph if m(G)=ex(G)m(G)=ex(G) and an extreme geodesic graph if g(G)=ex(G)g(G)=ex(G). Extreme monophonic graphs of order pp with monophonic number pp and p−1p−1 are characterized. It is shown that every pair a,ba,b of integers with 0≤a≤b0≤a≤b is realized as the extreme order and monophonic number, respectively, of some graph. For positive integers r,dr,d and k≥3k≥3 with r<dr<d, it is shown that there exists an extreme monophonic graph GG of monophonic radius rr, monophonic diameter dd, and monophonic number kk. Also, we give a characterization result for a graph GG which is both extreme geodesic and extreme monophonic.
    Relation: Tamkang Journal of Mathematics 47(4), pp.393-404
    DOI: 10.5556/j.tkjm.47.2016.2045
    Appears in Collections:[Tamkang Journal of Mathematics] v.47 n.4

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML552View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback