Results 21 to 30 of about 187,084,903 (250)
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
Towards the specification and verification of modal properties for structured systems [PDF]
, 2012 System specification formalisms should come with suitable property specification languages and effective verification tools. We sketch a framework for the verification of quantified temporal properties of systems with dynamically evolving structure.
Andrea Vandin, Vandin, Andrea, Vandin A
core +1 more source
On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
AKCE International Journal of Graphs and Combinatorics, 2020 An L(2, 1)-coloring of a graph G is a mapping such that for all edges uv of G, and if u and v are at distance two in G. The span of an L(2, 1)-coloring f of G, denoted by span(f), is max The span of G, denoted by is the minimum span of all possible L(2 ...
Nibedita Mandal, Pratima Panigrahi
doaj +1 more source
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
3-degenerate induced subgraph of a planar graph [PDF]
, 2021 A graph $G$ is $d$-degenerate if every non-null subgraph of $G$ has a vertex of degree at most $d$. We prove that every $n$-vertex planar graph has a $3$-degenerate induced subgraph of order at least $3n/4$.Comment: 28 pages, 12 ...
Oum, Sang-il +12 more
core +1 more source
Span of a graph and maximal safety distance
Pojam raspona grafa po prvi puta uvode I. Banič i A. Taranenko u svojem radu [1] kako bi riješili problem određivanja maksimalne sigurne udaljenosti na kojoj se dva igrača mogu nalaziti obilazeći graf.
Šćepanović, Doris
core +4 more sources
Multi-bridge graphs are anti-magic
Electronic Journal of Graph Theory and Applications, 2022 An anti-magic graph is a graph whose |E| edges can be labeled with the first |E| natural numbers such that each edge receives a distinct number and each vertex receives a distinct vertex sum which is obtained by taking the sum of the labels of all the
Yu Bin Tai, Gek Ling Chia, Poh-Hwa Ong
doaj +1 more source
Solutions of Some L(2, 1)-Coloring Related Open Problems
Discussiones Mathematicae Graph Theory, 2016 An L(2, 1)-coloring (or labeling) of a graph G is a vertex coloring f : V (G) → Z+ ∪ {0} such that |f(u) − f(v)| ≥ 2 for all edges uv of G, and |f(u)−f(v)| ≥ 1 if d(u, v) = 2, where d(u, v) is the distance between vertices u and v in G.
Mandal Nibedita, Panigrahi Pratima
doaj +1 more source
Multiplicity-free gonality on graphs
Electronic Journal of Graph Theory and Applications, 2023 The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most 1 chip on each vertex.
Frances Dean +2 more
doaj +1 more source
On balance and consistency preserving 2-path signed graphs
Electronic Journal of Graph Theory and Applications, 2023 Let Σ = (G, σ) be a balanced and canonically consistent signed graph. The 2-path signed graph Σ#Σ = (G2, σ′) of Σ has the underlying graph as G2 and the sign σ′(uv) of an edge uv in it is −1 whenever in each uv-path of length 2 in Σ all edges are ...
Kshittiz Chettri +2 more
doaj +1 more source