Results 51 to 60 of about 187,749 (326)
One-Mother Vertex Graphs [PDF]
, 2011 In this paper we will define a new type of graph. The idea of this definition is based on when we illustrate the cardiovascular system by a graph we find that not all vertices have the same important so we define this new graph and call it 1- mother ...
Salama, F.
core +1 more source
The Power Graph of a Dihedral Group
EIGEN MATHEMATICS JOURNAL, 2022 Graph theory is one of the topics in mathematics that is quite interesting to study because it is applicable and can be combined with other mathematical topics such as group theory.
Evi Yunartika Asmarani +4 more
semanticscholar +1 more source
Environmental evolutionary graph theory. [PDF]
Journal of Theoretical Biology, 2013 Understanding the influence of an environment on the evolution of its resident population is a major challenge in evolutionary biology. Great progress has been made in homogeneous population structures while heterogeneous structures have received ...
Wes Maciejewski, Gregory J. Puleo
semanticscholar +1 more source
Game Chromatic Number of Tadpole Graph, Broom Graph, and Tribune Graph
JTAM (Jurnal Teori dan Aplikasi Matematika)Graph coloring game is one of application in graph theory. The goal in this article is determine game chromatic number of tadpole graph, broom graph, and tribune graph.
Fransiskus Fran, M Luthfi Abdurahman
doaj +1 more source
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
JTAM (Jurnal Teori dan Aplikasi Matematika)Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory
, 2018 The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications.
Yongfei Zhang +5 more
openaire +2 more sources
Crossing number is hard for cubic graphs [PDF]
, 2004 It was proved by [Garey, Johnson] that computing the crossing number of a graph is an NP -hard problem. Their reduction, however, used parallel edges and vertices of very high degrees.
Petr Hlineny +7 more
core +2 more sources
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
Tits alternatives for graph products [PDF]
, 2015 We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group satisfies this ...
Antolin, Yago, Minasyan, Ashot
core +1 more source