Graph colouring is the system of assigning a colour to each vertex of a graph.It is done in such a way that adjacent vertices do not have equal colour.It is fundamental in graph theory.It is often used to solve real-w...Graph colouring is the system of assigning a colour to each vertex of a graph.It is done in such a way that adjacent vertices do not have equal colour.It is fundamental in graph theory.It is often used to solve real-world problems like traffic light signalling,map colouring,scheduling,etc.Nowadays,social networks are prevalent systems in our life.Here,the users are considered as vertices,and their connections/interactions are taken as edges.Some users follow other popular users’profiles in these networks,and some don’t,but those non-followers are connected directly to the popular profiles.That means,along with traditional relationship(information flowing),there is another relation among them.It depends on the domination of the relationship between the nodes.This type of situation can be modelled as a directed fuzzy graph.In the colouring of fuzzy graph theory,edge membership plays a vital role.Edge membership is a representation of flowing information between end nodes of the edge.Apart from the communication relationship,there may be some other factors like domination in relation.This influence of power is captured here.In this article,the colouring of directed fuzzy graphs is defined based on the influence of relationship.Along with this,the chromatic number and strong chromatic number are provided,and related properties are investigated.An application regarding COVID-19 infection is presented using the colouring of directed fuzzy graphs.展开更多
The concept of graphlike manifolds was presented in [1] and the problem of counting the homeomorphic classes of graphlike manifolds has been studied in a series of articles, e.g., [1～8]. In this paper we suggest an a...The concept of graphlike manifolds was presented in [1] and the problem of counting the homeomorphic classes of graphlike manifolds has been studied in a series of articles, e.g., [1～8]. In this paper we suggest an approach based on the graph colouring, Abelian group and the combinatorial enumeration method.展开更多
By establishing the connection between graph colouring and the solution of some equation systems in finite fields, we obtain some formulas to the number of solutions of some equation systems in finite fields, in terms...By establishing the connection between graph colouring and the solution of some equation systems in finite fields, we obtain some formulas to the number of solutions of some equation systems in finite fields, in terms of chromatic polynomial of a graph.展开更多
基金supported and funded by the Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(2018R1D1A1B07049321).
文摘Graph colouring is the system of assigning a colour to each vertex of a graph.It is done in such a way that adjacent vertices do not have equal colour.It is fundamental in graph theory.It is often used to solve real-world problems like traffic light signalling,map colouring,scheduling,etc.Nowadays,social networks are prevalent systems in our life.Here,the users are considered as vertices,and their connections/interactions are taken as edges.Some users follow other popular users’profiles in these networks,and some don’t,but those non-followers are connected directly to the popular profiles.That means,along with traditional relationship(information flowing),there is another relation among them.It depends on the domination of the relationship between the nodes.This type of situation can be modelled as a directed fuzzy graph.In the colouring of fuzzy graph theory,edge membership plays a vital role.Edge membership is a representation of flowing information between end nodes of the edge.Apart from the communication relationship,there may be some other factors like domination in relation.This influence of power is captured here.In this article,the colouring of directed fuzzy graphs is defined based on the influence of relationship.Along with this,the chromatic number and strong chromatic number are provided,and related properties are investigated.An application regarding COVID-19 infection is presented using the colouring of directed fuzzy graphs.
文摘The concept of graphlike manifolds was presented in [1] and the problem of counting the homeomorphic classes of graphlike manifolds has been studied in a series of articles, e.g., [1～8]. In this paper we suggest an approach based on the graph colouring, Abelian group and the combinatorial enumeration method.
文摘By establishing the connection between graph colouring and the solution of some equation systems in finite fields, we obtain some formulas to the number of solutions of some equation systems in finite fields, in terms of chromatic polynomial of a graph.
