Results 21 to 30 of about 63,549 (264)
A review on graph representation for object-oriented programming [PDF]
BIO Web of ConferencesRelationships and connections between entities are typically represented by graphs, a fundamental data structure in computer science. A graph illustrates the control flow among statements within a program, whereas a dependence graph delineates the ...
Farooq Khattak Umar +2 more
doaj +1 more source
Oriented Threshold Graphs [PDF]
Australas. J Comb., 2015 Threshold graphs are a prevalent and widely studied class of simple graphs. They have several equivalent definitions which makes them a go-to class for finding examples and counter examples when testing and learning. This versatility has led to many results about threshold graphs and similar structures.
openaire +3 more sources
Oriented Coloring on Recursively Defined Digraphs
Algorithms, 2019 Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G =
Frank Gurski +2 more
doaj +1 more source
Colorings and orientations of graphs [PDF]
Combinatorica, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon, Michael Tarsi
openaire +2 more sources
Acyclic orientations of graphs [PDF]
Discrete Mathematics, 1973 AbstractLet G be a finite graph with p vertices and χ its chromatic polynomial. A combinatorial interpretation is given to the positive integer(−1)pχ(−λ), where λ is a positive integer, in terms of acyclic orientations of G. In particular, (−1)pχ(−1) is the number of acyclic orientations of G.
openaire +2 more sources
The oriented chromatic number of edge-amalgamation of cycle graph
Indonesian Journal of Combinatorics, 2019 An oriented k − coloring of an oriented graph G⃗ is a partition of V(G⃗) into k color classes such that no two adjacent vertices belong to the same color class, and all the arcs linking the two color classes have the same direction.
Dina Eka Nurvazly +2 more
doaj +1 more source
The complexity of deciding whether a graph admits an orientation with fixed weak diameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 An oriented graph $\overrightarrow{G}$ is said weak (resp. strong) if, for every pair $\{ u,v \}$ of vertices of $\overrightarrow{G}$, there are directed paths joining $u$ and $v$ in either direction (resp. both directions).
Julien Bensmail +2 more
doaj +1 more source
Egalitarian Graph Orientations
Journal of Graph Algorithms and Applications, 2017 Given an undirected graph, one can assign directions to each of the edges of the graph, thus orienting the graph. To be as egalitarian as possible, one may wish to find an orientation such that no vertex is unfairly hit with too many arcs directed into it. We discuss how this objective arises in problems resulting from telecommunications.
Glencora Borradaile +5 more
openaire +2 more sources
Oriented Chromatic Number of Cartesian Products Pm □ Pn and Cm □ Pn
Discussiones Mathematicae Graph Theory, 2022 We consider oriented chromatic number of Cartesian products of two paths Pm □ Pn and of Cartesian products of paths and cycles, Cm □ Pn. We say that the oriented graph G→\vec G is colored by an oriented graph H→\vec H if there is a homomorphism from G ...
Nenca Anna
doaj +1 more source
An Oriented Version of the 1-2-3 Conjecture
Discussiones Mathematicae Graph Theory, 2015 The well-known 1-2-3 Conjecture addressed by Karoński, Luczak and Thomason asks whether the edges of every undirected graph G with no isolated edge can be assigned weights from {1, 2, 3} so that the sum of incident weights at each vertex yields a proper ...
Baudon Olivier +2 more
doaj +1 more source