Results 31 to 40 of about 507,111 (281)
Multiple Kronecker covering graphs
European Journal of Combinatorics, 2008 4 pages, 2 ...
Imrich, Wilfried, Pisanski, Tomaž
openaire +3 more sources
Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
Journal of Applied Mathematics, 2013 Covering is a widely used form of data structures. Covering-based rough set theory provides a systematic approach to this data. In this paper, graphs are connected with covering-based rough sets.
Shiping Wang +3 more
doaj +1 more source
Negative (and positive) circles in signed graphs: A problem collection
AKCE International Journal of Graphs and Combinatorics, 2018 A signed graph is a graph whose edges are labeled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles. Here I describe
Thomas Zaslavsky
doaj +1 more source
TASKS MAPPING METHOD FOR COARSE GRAIN RECONFIGURABLE SYSTEMS [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2014 This paper deals with analysis of existing approaches to tasks mapping on reconfigurable computing systems with special attention paid to mapping methods for coarse grained reconfigurable computing systems. The purpose and objectives of a new heuristic
A. S. Rumyantsev
doaj
Some Covering and Packing Problems for Mixed Triples
AppliedMathA mixed graph has both edges and directed edges (or “arcs”). A complete mixed graph on v vertices, denoted Mv, has, for every pair of vertices u and v, an edge {u,v}, an arc (u,v), and an arc (v,u).
Benkam Bobga, Robert Gardner
doaj +1 more source
Two constructions of -antimagic graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph. A graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . A graph admitting an -covering is called --antimagic if there is a bijection such that for each subgraph of isomorphic to , the sum of labels of all the
Andrea Semaničová-Feňovčíková +2 more
doaj +1 more source
Matchings, coverings, and Castelnuovo-Mumford regularity
, 2014 We show that the co-chordal cover number of a graph G gives an upper bound for the Castelnuovo-Mumford regularity of the associated edge ideal. Several known combinatorial upper bounds of regularity for edge ideals are then easy consequences of covering ...
Woodroofe, Russ
core +1 more source
Matching Number, Independence Number, and Covering Vertex Number of Γ(Zn)
Mathematics, 2019 Graph invariants are the properties of graphs that do not change under graph isomorphisms, the independent set decision problem, vertex covering problem, and matching number problem are known to be NP-Hard, and hence it is not believed that there are ...
Eman AbuHijleh +3 more
doaj +1 more source
On the Adjacent Eccentric Distance Sum Index of Graphs. [PDF]
PLoS ONE, 2015 For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as [Formula in text], where [Formula in text] is the sum of all distances ...
Hui Qu, Shujuan Cao
doaj +1 more source