Results 21 to 30 of about 389,989 (220)

Total vertex irregularity strength of trees with maximum degree five

open access: yesElectronic 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

Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star

open access: yesElectronic 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

The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

open access: yesElectronic 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

Locating-Chromatic Number of Amalgamation of Stars

open access: yesJournal of Mathematical and Fundamental Sciences, 2013
Let G be a connected graph and c a proper coloring of G . For i Æ’­1,2,Æ’»,k define the color class i C as the set of vertices receiving color i . The color code c (v) "ž¨ of a vertex v in G is the ordered k -tuple 1 ( ( , ), , ( , )) k d v C Æ’» d v C ...
Asmiati Asmiati   +2 more
doaj   +1 more source

A method to construct graphs with certain partition dimension

open access: yesElectronic 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

SMARANDACHE GEOMETRIES & MAP THEORY WITH APPLICATIONS (I) [PDF]

open access: yes, 2006
Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an even more important work for mathematician is to apply combinatorics to other mathematics and other sciences beside just to find ...
Mao, Linfan
core   +1 more source

On size multipartite Ramsey numbers for stars versus paths and cycles

open access: yesElectronic 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

On the restricted size Ramsey number for P3 versus dense connected graphs

open access: yesElectronic 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

Feynman Diagrams of Generalized Matrix Models and the Associated Manifolds in Dimension 4 [PDF]

open access: yes, 2000
The problem of constructing a quantum theory of gravity has been tackled with very different strategies, most of which relying on the interplay between ideas from physics and from advanced mathematics.
Ambjorn   +25 more
core   +4 more sources

Modular Irregular Labeling on Double-Star and Friendship Graphs

open access: yesJournal 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

Home - About - Disclaimer - Privacy