Results 11 to 20 of about 15,285 (303)
Combinatorial representations [PDF]
, 2011 23pp. Submitted to J. Combinatorial Theory (Series A)arXiv:1109.1216v1 [math.CO]23pp. Submitted to J. Combinatorial Theory (Series A)23pp. Submitted to J.
Maximilien Gadouleau +10 more
core +2 more sources
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
On Size Bipartite and Tripartite Ramsey Numbers for The Star Forest and Path on 3 Vertices
Journal of Mathematical and Fundamental Sciences, 2020 For simple graphs G and H the size multipartite Ramsey number mj(G,H) is the smallest natural number t such that any arbitrary red-blue coloring on the edges of Kjxt contains a red G or a blue H as a subgraph.
Anie Lusiani +2 more
doaj +1 more source
Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star
Electronic Journal of Graph Theory and Applications, 2022 Let F, G and H be simple graphs. The notation F → (G, H) means that for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H.
Maya Nabila +2 more
doaj +1 more source
On size multipartite Ramsey numbers for stars versus paths and cycles
Electronic Journal of Graph Theory and Applications, 2017 Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the size multipartite Ramsey number $m_j(G_1,G_2)$ is the ...
Anie Lusiani +2 more
doaj +1 more source
A method to construct graphs with certain partition dimension
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we propose a method for constructing new graphs from a given graph G so that the resulting graphs have the partition dimension at most one larger than the partition dimension of the graph G.
Debi Oktia Haryeni +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
Modular Irregular Labeling on Double-Star and Friendship Graphs
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +1 more source
Combinatorial proofs in mathematics teaching [PDF]
, 2022 U ovom diplomskom radu bavimo se kombinatornim dokazima u nastavi matematike. Na početku rada ukratko smo iznijeli povijesni razvoj dokaza. U drugom dijelu rada naveli smo svrhu i potrebu za dokazima unutar nastave matematike; najprije iz učeničke ...
Mamić, Zrinka
core