Results 1 to 10 of about 184,466 (302)
Strategic Competence of Pre-Service Mathematics Teachers in Solving Environment and Culture-Based Combinatorial Problems [PDF]
BIO Web of Conferences, 2023 Strategy is a very important part in solving mathematical problems. Pre-service mathematics teachers must master a variety of problem solving strategies.
Ramadhona Rezky +2 more
doaj +2 more sources
Combinatorial Speculations and the Combinatorial Conjecture for Mathematics [PDF]
, 2006 19 pages with 6 ...
Linfan Mao
openaire +3 more sources
The strong 3-rainbow index of some certain graphs and its amalgamation [PDF]
Opuscula Mathematica, 2022 We introduce a strong \(k\)-rainbow index of graphs as modification of well-known \(k\)-rainbow index of graphs. A tree in an edge-colored connected graph \(G\), where adjacent edge may be colored the same, is a rainbow tree if all of its edges have ...
Zata Yumni Awanis, A.N.M. Salman
doaj +1 more source
On locating-dominating number of comb product graphs
Indonesian Journal of Combinatorics, 2020 We consider a set D ⊆ V(G) which dominate G and for every two distinct vertices x, y ∈ V(G) \ D, the open neighborhood of x and y in D are different. The minimum cardinality of D is called the locating-dominating number of G.
Aswan Anggun Pribadi +1 more
doaj +1 more source
Locating-chromatic number of the edge-amalgamation of trees
Indonesian Journal of Combinatorics, 2020 The investigation on the locating-chromatic number of a graph was initiated by Char- trand et al. (2002). This concept is in fact a special case of the partition dimension of a graph. This topic has received much attention. However, the results are still
Dian Kastika Syofyan +2 more
doaj +1 more source
The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
Electronic Journal of Graph Theory and Applications, 2020 An edge-colored graph G is rainbow k-connected, if there are k-internally disjoint rainbow paths connecting every pair of vertices of G. The rainbow k-connection number of G, denoted by rck(G), is the minimum number of colors needed for which there ...
Bety Hayat Susanti +2 more
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2018 Let and be simple graphs. We write to mean that any red–blue coloring of all edges of will contain either a red copy of or a blue copy of A graph (without isolated vertices) satisfying and for each is called a Ramsey -minimal graph. The set of all Ramsey
Kristiana Wijaya +3 more
doaj +2 more sources
The connected size Ramsey number for matchings versus small disconnected graphs
Electronic Journal of Graph Theory and Applications, 2019 Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbitrarily colored by red or blue, then there always exists either a red subgraph G or a blue subgraph H.
Hilda Assiyatun +2 more
doaj +1 more source
Total vertex irregularity strength of trees with maximum degree five
Electronic Journal of Graph Theory and Applications, 2018 In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of degrees 1, 2 and 3 in T. This paper will confirm this conjecture by considering all trees with
S. Susilawati +2 more
doaj +1 more source
The geodetic domination number of comb product graphs
Electronic Journal of Graph Theory and Applications, 2020 A subset S of vertices in graph G is called a geodetic set if every vertex in V(G) \ S lies on a shortest path between two vertices in S. A subset S of vertices in G is called a dominating set if every vertex in V(G) \ S is adjacent to a vertex in S ...
Dimas Agus Fahrudin, Suhadi Wido Saputro
doaj +1 more source