Local Exponent of Asymmetric Two-colored Lollipops

被引:1
|
作者
Perangin-angin, Muda G. [1 ]
Fathoni, Muhammad [1 ]
Syahmarani, Aghni [1 ]
Suwilo, Saib [1 ]
机构
[1] Univ Smatera Utara, Dept Math, Medan 20155, Indonesia
关键词
two-colored digraphs; primitive; local exponent; lollipops; MATRIX PAIRS; DIGRAPHS;
D O I
10.1063/1.4903624
中图分类号
O59 [应用物理学];
学科分类号
摘要
A two-colored digraph is a digraph each of whose arcs is colored by red or blue. An (h,k)-walk in a two-colored digraph is a walk consisting of h red arcs and k blue arcs. A two-colored digraph is primitive provided that for each pair of vertices a and nu there exists an (h,k)-walk from a to nu and from nu to a. The smallest of such positive integer h+k is called the exponent of D. Let D be a primitive two colored digraph and let nu be a vertex in D. The local exponent off) at the vertex nu, denoted exp(nu,D), is defined to be the smallest positive integer h+k over all nonnegative integers h and k such that for each vertex u in D there exists an (h,k)-walk from nu to a. An (s,n s)-lollipop is a connected symmetric digraphs on n vertices consisting of an s-cycle and an (n-s)-path with one vertex in common. A two-colored lollipop is called asymmetric provided that the arc (u,nu) is colored red whenever (nu,u) is blue and vice versa. We discuss local exponent of asymmetric two-colored lollipop especially the class (n,0)-lollipop where n is odd. We present formula for local exponent of a vertex nu that depend on n and the distance of nu to a special vertex that lies on the n-cycle.
引用
下载
收藏
页码:471 / 478
页数:8
相关论文
共 50 条
  • [21] Special monochromatic trees in two-colored complete graphs
    Chen, GT
    Schelp, RH
    Soltes, LI
    JOURNAL OF GRAPH THEORY, 1997, 24 (01) : 59 - 67
  • [22] Parameter Estimation of a Two-Colored Urn Model Class
    Le Goff, Line Chloe
    Soulier, Philippe
    INTERNATIONAL JOURNAL OF BIOSTATISTICS, 2017, 13 (01):
  • [23] Singular fibers of two-colored maps and cobordism invariants
    Yamamoto, Takahiro
    PACIFIC JOURNAL OF MATHEMATICS, 2008, 234 (02) : 379 - 398
  • [24] Average Fermat Distances Of Two-Colored Substitution Networks
    Lei, Lei
    Jia, Qi
    Xi, Lifeng
    Fractals, 2022, 30 (06):
  • [25] The classification of tensor categories of two-colored noncrossing partitions
    Tarrago, Pierre
    Weber, Moritz
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2018, 154 : 464 - 506
  • [26] AVERAGE FERMAT DISTANCES OF TWO-COLORED SUBSTITUTION NETWORKS
    Lei, Lei
    Jia, Qi
    Xi, Lifeng
    FRACTALS-COMPLEX GEOMETRY PATTERNS AND SCALING IN NATURE AND SOCIETY, 2022, 30 (06)
  • [27] VERTEX EXPONENTS OF TWO-COLORED EXTREMAL MINISTRONG DIGRAPHS
    Suwilo, Saib
    PROCEEDINGS OF THE FOURTH GLOBAL CONFERENCE ON POWER CONTROL AND OPTIMIZATION, 2011, 1337 : 235 - 242
  • [28] VERTEX EXPONENTS OF A CLASS OF TWO-COLORED HAMILTONIAN DIGRAPHS
    Syahmarani, Aghni
    Suwil, Saib
    JOURNAL OF THE INDONESIAN MATHEMATICAL SOCIETY, 2012, 18 (01) : 1 - 19
  • [29] Monochromatic empty triangles in two-colored point sets
    Pach, Janos
    Toth, Geza
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (09) : 1259 - 1261
  • [30] The Scrambling Index of a Class of Two-colored Hamiltonian Digraphs
    Mardiningsih
    Pasaribu, Merryanty L.
    INTERNATIONAL CONFERENCE ON MATHEMATICS, ENGINEERING AND INDUSTRIAL APPLICATIONS 2016 (ICOMEIA2016), 2016, 1775