Results 31 to 40 of about 1,365,580 (287)
On The Partition Dimension of Disconnected Graphs
Journal of Mathematical and Fundamental Sciences, 2017 For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω.
Debi Oktia Haryeni +2 more
doaj +1 more source
On the restricted size Ramsey number for P3 versus dense connected graphs
Electronic Journal of Graph Theory and Applications, 2020 Let F, G and H be simple graphs. A graph F is said a (G,H)-arrowing graph if in any red-blue coloring of edges of F we can find a red G or a blue H. The size Ramsey number of G and H, ŕ(G,H), is the minimum size of F.
Denny Riama Silaban +2 more
doaj +1 more source
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
, 2005 A combinatorial map is a connected topological graph cellularly embedded in a surface. As a linking of combinatorial configuration with the classical mathematics, it fascinates more and more mathematician’s interesting.
Linfan Mao, MAO, LINFAN
core +1 more source
An introduction to Smarandache multi-spaces and mathematical combinatorics [PDF]
, 2007 These Smarandache spaces are right theories for objectives by logic. However, the mathematical combinatorics is a combinatorial theory for branches in classical mathematics motivated by a combinatorial speculation.
Linfan Mao, Mao. Linfan
core +1 more source
A spotlight on mathematics education in the Netherlands and the central role of Realistic Mathematics Education [PDF]
, 2020 In this introductory chapter I give a preview of the landscape of issues concerning mathematics education in the Netherlands and the role of Realistic Mathematics Education (RME) that one can come across in this volume, which contains the reflections of ...
Sub Mathematics Education +5 more
core +3 more sources
Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs
Mathematics, 2022 Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)).
Wahyuni Abidin +2 more
doaj +1 more source
Restricted size Ramsey number for path of order three versus graph of order five
Electronic Journal of Graph Theory and Applications, 2017 Let $G$ and $H$ be simple graphs. The Ramsey number for a pair of graph $G$ and $H$ is the smallest number $r$ such that any red-blue coloring of edges of $K_r$ contains a red subgraph $G$ or a blue subgraph $H$.
Denny Riama Silaban +2 more
doaj +1 more source
On the Restricted Size Ramsey Number Involving a Path P3
Discussiones Mathematicae Graph Theory, 2019 For any pair of graphs G and H, both the size Ramsey number ̂r(G,H) and the restricted size Ramsey number r*(G,H) are bounded above by the size of the complete graph with order equals to the Ramsey number r(G,H), and bounded below by e(G) + e(H) − 1 ...
Silaban Denny Riama +2 more
doaj +1 more source
Geometrical Theory on Combinatorial Manifolds [PDF]
, 2005 Topological and differential structures such as those of d-pathwise connected, homotopy classes, fundamental d-groups in topology and tangent vector fields, tensor fields, connections, Minkowski norms in differential geometry on these finitely ...
Mao, Linfan
core +1 more source
Homomorphic image orders on combinatorial structures [PDF]
, 2015 Combinatorial structures have been considered under various orders, including substructure order and homomorphism order. In this paper, we investigate the homomorphic image order, corresponding to the existence of a surjective homomorphism between two ...
Ruskuc, Nik, Huczynska, Sophie
core +1 more source