四個本原有向圖的scrambling指數(shù)和廣義competition指數(shù)
發(fā)布時間:2019-05-06 21:16
【摘要】:組合數(shù)學(xué)是一門研究離散對象的科學(xué),應(yīng)用十分廣泛。圖論是組合數(shù)學(xué)中的一個重要分支,它是解決幾何、數(shù)論、運籌學(xué)和優(yōu)化等領(lǐng)域中各種組合問題非常有用的工具。 本文主要結(jié)合圖論和集合論的相關(guān)知識,通過對本原有向圖中每個頂點經(jīng)過k長途徑所到達點的集合進行分析,得出幾個特殊本原有向圖的scrambling指數(shù),廣義scrambling指數(shù)及廣義competition指數(shù)。 第一章:主要介紹了組合數(shù)學(xué)和圖論的基本概念及研究背景,給出了本原有向圖的scrambling指數(shù)、廣義scrambling指數(shù)與廣義competition指數(shù)的概念,,簡述了本領(lǐng)域國內(nèi)外的研究現(xiàn)狀及進展,最后列舉出本文所得出的一些主要結(jié)論。 第二章:研究三個特殊本原有向圖的scrambling指數(shù)。 第三章:研究三個特殊本原有向圖的廣義scrambling指數(shù)。 第四章:研究一個本原有向圖的廣義scrambling指數(shù)和廣義competition指數(shù)。
[Abstract]:Combinatorial mathematics is a science that studies discrete objects and is widely used. Graph theory is an important branch of combinatorial mathematics. It is a very useful tool for solving various combinatorial problems in the fields of geometry, number theory, operational research and optimization. In this paper, based on the knowledge of graph theory and set theory, the scrambling exponent, generalized scrambling index and generalized competition index of some special primitive digraphs are obtained by analyzing the set of points that each vertex reaches through the k-long path in the original digraph. In the first chapter, the basic concepts and research background of combinatorial mathematics and graph theory are introduced. The concepts of scrambling index, generalized scrambling index and generalized competition index of the original digraph are given, and the present situation and progress of the research in this field at home and abroad are summarized. Finally, some main conclusions obtained in this paper are listed. In chapter 2, we study the scrambling exponents of three special original digraphs. In chapter 3, we study the generalized scrambling exponents of three special primitive digraphs. In chapter 4, we study the generalized scrambling exponent and generalized competition exponent of a primitive digraph.
【學(xué)位授予單位】:中北大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2015
【分類號】:O157.5
本文編號:2470501
[Abstract]:Combinatorial mathematics is a science that studies discrete objects and is widely used. Graph theory is an important branch of combinatorial mathematics. It is a very useful tool for solving various combinatorial problems in the fields of geometry, number theory, operational research and optimization. In this paper, based on the knowledge of graph theory and set theory, the scrambling exponent, generalized scrambling index and generalized competition index of some special primitive digraphs are obtained by analyzing the set of points that each vertex reaches through the k-long path in the original digraph. In the first chapter, the basic concepts and research background of combinatorial mathematics and graph theory are introduced. The concepts of scrambling index, generalized scrambling index and generalized competition index of the original digraph are given, and the present situation and progress of the research in this field at home and abroad are summarized. Finally, some main conclusions obtained in this paper are listed. In chapter 2, we study the scrambling exponents of three special original digraphs. In chapter 3, we study the generalized scrambling exponents of three special primitive digraphs. In chapter 4, we study the generalized scrambling exponent and generalized competition exponent of a primitive digraph.
【學(xué)位授予單位】:中北大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2015
【分類號】:O157.5
【參考文獻】
相關(guān)期刊論文 前4條
1 方煒;高玉斌;李忠善;;2-Competition Index of Primitive Digraphs Using Graph Theory[J];Journal of Donghua University(English Edition);2014年03期
2 高玉斌,邵燕靈;雙色雙向圈的本原指數(shù)(英文)[J];黑龍江大學(xué)自然科學(xué)學(xué)報;2004年04期
3 邵嘉裕,王建中,李桂榮;廣義本原指數(shù)及其極圖的完全刻劃[J];數(shù)學(xué)年刊A輯(中文版);1994年05期
4 馬紅平;苗正科;;一類二元關(guān)系的公共后繼指數(shù)集(英文)[J];數(shù)學(xué)研究與評論;2008年03期
本文編號:2470501
本文鏈接:http://sikaile.net/kejilunwen/yysx/2470501.html
最近更新
教材專著