Results 1 to 10 of about 1,852 (118)
AKCE International Journal of Graphs and Combinatorics, 2020 An edge labeled graph is a graph whose edges are labeled with non-zero ideals of a commutative ring . A Generalized Spline on an edge labeled graph is a vertex labeling of by elements of the ring , such that the difference between any two adjacent vertex
Radha Madhavi Duggaraju, Lipika Mazumdar
doaj +2 more sources
Seidel energy of complete multipartite graphs
Special Matrices, 2021 The Seidel energy of a simple graph G is the sum of the absolute values of the eigenvalues of the Seidel matrix of G. In this paper we study the Seidel eigenvalues of complete multipartite graphs and find the exact value of the Seidel energy of the ...
Oboudi Mohammad Reza
doaj +2 more sources
Completeness-Resolvable Graphs [PDF]
Graphs and Combinatorics, 2022 Given a connected graph $G=(V(G), E(G))$, the length of a shortest path from a vertex $u$ to a vertex $v$ is denoted by $d(u,v)$. For a proper subset $W$ of $V(G)$, let $m(W)$ be the maximum value of $d(u,v)$ as $u$ ranging over $W$ and $v$ ranging over $V(G)\setminus W$. The proper subset $W=\{w_1,\ldots,w_{|W|}\}$ is a {\em completeness-resolving set}
Min Feng 0004, Xuanlong Ma, Huiling Xu
openaire +3 more sources
Dispersion on the Complete Graph
Random Structures & Algorithms, 2023 ABSTRACTWe consider a synchronous process of particles moving on the vertices of a graph , introduced by Cooper et al. Initially, particles are placed on a vertex of . At the beginning of each time step, for every vertex inhabited by at least two particles, each of these particles moves independently to a neighbor chosen uniformly at random.
Umberto De Ambroggio +2 more
openaire +4 more sources
JTAM (Jurnal Teori dan Aplikasi Matematika), 2022 The research in graph theory has been widened by combining it with ring. In this paper, we introduce the definition of a non-braid graph of a ring. The non-braid graph of a ring R, denoted by YR, is a simple graph with a vertex set R\B(R), where B(R) is
Era Setya Cahyati +3 more
doaj +1 more source
Domination number of middle graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs,
Farshad Kazemnejad +3 more
doaj +1 more source
Decomposition of complete graphs into small graphs [PDF]
Opuscula Mathematica, 2010 In 1967, A. Rosa proved that if a bipartite graph \(G\) with \(n\) edges has an \(\alpha\)-labeling, then for any positive integer \(p\) the complete graph \(K_{2np+1}\) can be cyclically decomposed into copies of \(G\).
Dalibor Froncek
doaj +1 more source
An Improvement of the Lower Bound on the Minimum Number of ≤k-Edges
Mathematics, 2021 In this paper, we improve the lower bound on the minimum number of ≤k-edges in sets of n points in general position in the plane when k is close to n2.
Javier Rodrigo +3 more
doaj +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source
Interval edge-coloring: A model of curriculum scheduling
AKCE International Journal of Graphs and Combinatorics, 2020 Considering the appointments that teachers plan to teach some courses for specific classes, the problem is to schedule the curriculum such that the time for each teacher is consecutive.
Zehui Shao +4 more
doaj +1 more source