Extrema property of the -ranking of directed paths and cycles

详细信息    查看全文

• 作者：Breeanne Baker Swart^a ; ^{breeanne.swart@citadel.edu" class="auth_mail" title="E-mail the corresponding author} ; Rigoberto Fló ; rez^a ; ^{rflorez1@citadel.edu" class="auth_mail" title="E-mail the corresponding author} ; Darren A. Narayan^b ; ^{darren.narayan@rit.edu" class="auth_mail" title="E-mail the corresponding author} ; George L. Rudolph^a ; ^{george.rudolph@citadel.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：kk-ranking ; Directed path ; Directed cycle ; Adjacency matrix ; Sierpinski triangle
• 刊名：?AKCE International Journal of Graphs and Combinatorics
• 出版年：2016
• 出版时间：April 2016
• 年：2016
• 卷：13
• 期：1
• 页码：38-53
• 全文大小：450 K

文摘

A mmlsi5" class="mathmlsrc">mulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0972860015300384&_mathId=si5.gif&_user=111111111&_pii=S0972860015300384&_rdoc=1&_issn=09728600&md5=56ae4f9a2679085b42b29a239000f648" title="Click to view the MathML source">kmathContainer hidden">mathCode"><math altimg="si5.gif" overflow="scroll"><mi>kmi>math>-ranking of a directed graph mmlsi7" class="mathmlsrc">mulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0972860015300384&_mathId=si7.gif&_user=111111111&_pii=S0972860015300384&_rdoc=1&_issn=09728600&md5=b61cfbe55c51874ee7b1938dadcc66e9" title="Click to view the MathML source">GmathContainer hidden">mathCode"><math altimg="si7.gif" overflow="scroll"><mi>Gmi>math> is a labeling of the vertex set of mmlsi7" class="mathmlsrc">mulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0972860015300384&_mathId=si7.gif&_user=111111111&_pii=S0972860015300384&_rdoc=1&_issn=09728600&md5=b61cfbe55c51874ee7b1938dadcc66e9" title="Click to view the MathML source">GmathContainer hidden">mathCode"><math altimg="si7.gif" overflow="scroll"><mi>Gmi>math> with mmlsi5" class="mathmlsrc">mulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0972860015300384&_mathId=si5.gif&_user=111111111&_pii=S0972860015300384&_rdoc=1&_issn=09728600&md5=56ae4f9a2679085b42b29a239000f648" title="Click to view the MathML source">kmathContainer hidden">mathCode"><math altimg="si5.gif" overflow="scroll"><mi>kmi>math> positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The m>rank number of  m> mmlsi7" class="mathmlsrc">mulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0972860015300384&_mathId=si7.gif&_user=111111111&_pii=S0972860015300384&_rdoc=1&_issn=09728600&md5=b61cfbe55c51874ee7b1938dadcc66e9" title="Click to view the MathML source">GmathContainer hidden">mathCode"><math altimg="si7.gif" overflow="scroll"><mi>Gmi>math> is defined to be the smallest mmlsi5" class="mathmlsrc">mulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0972860015300384&_mathId=si5.gif&_user=111111111&_pii=S0972860015300384&_rdoc=1&_issn=09728600&md5=56ae4f9a2679085b42b29a239000f648" title="Click to view the MathML source">kmathContainer hidden">mathCode"><math altimg="si5.gif" overflow="scroll"><mi>kmi>math> such that mmlsi7" class="mathmlsrc">mulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0972860015300384&_mathId=si7.gif&_user=111111111&_pii=S0972860015300384&_rdoc=1&_issn=09728600&md5=b61cfbe55c51874ee7b1938dadcc66e9" title="Click to view the MathML source">GmathContainer hidden">mathCode"><math altimg="si7.gif" overflow="scroll"><mi>Gmi>math> has a mmlsi5" class="mathmlsrc">mulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0972860015300384&_mathId=si5.gif&_user=111111111&_pii=S0972860015300384&_rdoc=1&_issn=09728600&md5=56ae4f9a2679085b42b29a239000f648" title="Click to view the MathML source">kmathContainer hidden">mathCode"><math altimg="si5.gif" overflow="scroll"><mi>kmi>math>-ranking. We find the largest possible directed graph that can be obtained from a directed path or a directed cycle by attaching new edges to the vertices such that the new graphs have the same rank number as the original graphs. The adjacency matrix of the resulting graph is embedded in the Sierpiński triangle.

We present a connection between the number of edges that can be added to paths and the Stirling numbers of the second kind. These results are generalized to create directed graphs which are unions of directed paths and directed cycles that maintain the rank number of a base graph of a directed path or a directed cycle.