Results 11 to 20 of about 187,084,903 (250)

Graph products of groups [PDF]

, 1990
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core   +7 more sources

Towards a Maude tool for model checking temporal graph properties [PDF]

, 2011
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto, Luch Lafuente A, Vandin, Andrea, Lafuente, Alberto Lluch, Vandin A   +4 more
core   +1 more source

A Heuristic for Direct Product Graph Decomposition [PDF]

, 2023
In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph G with adjacency matrix Adj(G), our heuristic
Moreno Marzolla, Luca Calderoni, Luciano Margara   +2 more
core   +1 more source

Ideal Graph of a Graph [PDF]

, 2011
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core   +1 more source

On matching number, decomposition and representation of well-formed graph

Electronic Journal of Graph Theory and Applications, 2023
In this paper, we find a special type of non-traceable cubic bridge graph called well-formed graph whose central fragment is isomorphic to a hairy cycle and whose branches are pairwise isomorphic.
Alex Ralph Baisa Nieva, Karen P. Nocum
doaj   +1 more source

Span of a graph [PDF]

, 2022
V magistrskem delu predstavimo osnove teorije grafov, razpone grafa, z njimi povezane pojme in rezultate. Pojem razpona grafa povežemo z določanjem največje varnostne razdalje, ki jo lahko v grafu ohranjata dva igralca, ki želita obiskati vsa vozlišča ...
Drožđek, Lara
core  

Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks [PDF]

, 2017
Span(Graph) was introduced by Katis, Sabadini and Walters as a categorical algebra of automata with interfaces, with main operation being communicating-parallel composition.
Kasangian, Stefano, Gianola, Alessandro, Kasangian S., Sabadini N., Sabadini, Nicoletta, Gianola A.   +5 more
core   +1 more source

IMPLEMENTASI ALGORITMA GREEDY UNTUK MELAKUKAN GRAPH COLORING: STUDI KASUS PETA PROPINSI JAWA TIMUR

Jurnal Informatika, 2010
This paper will describe us how to coloring a graph by using greedy algorithm with the case study province of Jawa Timur. From this research we will know that for graph coloring at Jawa Timur Province only use four difference colors.
Ardiansyah Ardiansyah, Fery Sofian Efendi, Syaifullah Syaifullah, Mateus Pinto, Pujianto Pujianto, Hendro Steven Tempake   +5 more
doaj   +1 more source

On Ramsey (C4, K1, n)-minimal graphs

Electronic Journal of Graph Theory and Applications, 2023
Let F, G and H be any simple graphs. The notation F → (G, H) means for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H. If F → (G, H), then graph F is called a Ramsey graph for (G, H).
Hilda Assiyatun, Maya Nabila, Edy Tri Baskoro   +2 more
doaj   +1 more source

Forcing (G,D)-number of a Graph [PDF]

, 2011
By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple ...
Nagarajan, A., A.Nagarajan, Palani, K., K.Palani   +3 more
core   +1 more source