Results 1 to 10 of about 2,686,069 (331)
On the Boolean dimension of a graph and other related parameters [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph.
Maurice Pouzet +2 more
doaj +1 more source
Codes from $m$-ary $n$-cubes $Q^m_n$: a survey [PDF]
AUT Journal of Mathematics and Computing, 2023 We collect together some known results concerning the codes from adjacency matrices of the graph with vertices the nodes of the $m$-ary $n$-cube $Q^m_n$ and with adjacency defined by the Lee metric, and include some new results.
Jennifer Key, Bernardo Rodrigues
doaj +1 more source
Calculation of cams with concave profile in the MATHCAD system [PDF]
Омский научный вестник, 2022 The article shows the features of the cam with concave profile, the method of kinematic calculation of the pusher when it moves along a concave and rounded surface.
V. V. Ryndin +3 more
doaj +1 more source
Kinematic calculation of convex cam profile using MATHCAD program [PDF]
Омский научный вестник, 2021 The article shows the features of the construction of cams with a convex profile, the method of kinematic calculation of the pusher when it moves along a convex and rounded surface is given.
T. A. Polyakova +3 more
doaj +1 more source
Strong Perfect Cobondage Number of Standard Graphs
Ratio Mathematica, 2023 Let G be a simple graph. A subset S Í V(G) is called a strong (weak) perfect dominating set of G if |Ns(u) ∩ S| = 1(|Nw(u) ∩ S| = 1) for every u ∊V(G) - S where Ns(u) = {v ∊ V(G) / uv deg v ≥ deg u} (Nw(u) = {v ∊V(G) / uv deg v ≤ deg u}.
T. S Govindalakshmi, N Meena
doaj +1 more source
A method for eternally dominating strong grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices and no more than one guard may occupy a vertex.
Alizée Gagnon +7 more
doaj +1 more source
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Transactions on Graph Data and Knowledge [PDF]
Transactions on Graph Data and Knowledge, 2023 Transactions on Graph Data and Knowledge (TGDK) is a new journal publishing peer-reviewed research on graph-based abstractions for data and knowledge, as well as the techniques, theories, applications and results that arise in this setting.
Hogan, Aidan +3 more
doaj +1 more source
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mapping f from V(G) to M such that f(u) j(v) whenever uv is an arc in G and f(v)−f(u) −(f(t)−f(z)) whenever uv and zt are two arcs in G.
Mickael Montassier +2 more
doaj +1 more source