Results 1 to 10 of about 1,282,017 (178)
CoRR, 2015 This book is based on Graph Theory courses taught by P.A. Petrosyan, V.V. Mkrtchyan and R.R. Kamalian at Yerevan State University.
Petros A. Petrosyan +2 more
+5 more sources
Quantitative Graph Theory: A new branch of graph theory and network science [PDF]
Information Sciences, 2017 In this paper, we describe {\sc quantitative graph theory} and argue it is a new graph-theoretical branch in network science, however, with significant different features compared to classical graph theory. The main goal of quantitative graph theory is the structural quantification of information contained in complex networks by employing a {\it ...
Matthias Dehmer +2 more
exaly +4 more sources
On minimal blocking sets of the generalized quadrangle $Q(4, q)$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The generalized quadrangle $Q(4,q)$ arising from the parabolic quadric in $PG(4,q)$ always has an ovoid. It is not known whether a minimal blocking set of size smaller than $q^2 + q$ (which is not an ovoid) exists in $Q(4,q)$, $q$ odd. We present results
Miroslava Cimráková, Veerle Fack
doaj +1 more source
Hadamard matrices of order 36 and double-even self-dual [72,36,12] codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Before this work, at least 762 inequivalent Hadamard matrices of order 36 were known. We found 7238 Hadamard matrices of order 36 and 522 inequivalent [72,36,12] double-even self-dual codes which are obtained from all 2-(35,17,8) designs with an ...
Iliya Bouyukliev +2 more
doaj +1 more source
On the enumeration of uniquely reducible double designs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A double $2$-$(v,k,2 \lambda)$ design is a design which is reducible into two $2$-$(v,k,\lambda)$ designs. It is called uniquely reducible if it has, up to equivalence, only one reduction.
Veerle Fack +2 more
doaj +1 more source
On b-edge consecutive edge magic total labeling on trees
Electronic Journal of Graph Theory and Applications, 2022 Let G = (V, E) be a simple, connected, and undirected graph, where V and E are the set of vertices and the set of edges of G. An edge magic total labeling on G is a bijection f : V ∪ E → {1, 2, …, |V|+|E|}, provided that for every uv ∈ E, w(uv)=f(u)+f(v)+
Eunike Setiawan +2 more
doaj +1 more source
Multipartite Ramsey numbers for the union of stars
Electronic Journal of Graph Theory and Applications, 2022 Let s and k be positive integers with k ≥ 2 and G1, G2, …, Gk be simple graphs. The set multipartite Ramsey number, denoted by Ms(G1, G2, …, Gk), is the smallest positive integer c such that any k-coloring of the edges of Kc × s contains a monochromatic ...
I Wayan Palton Anuwiksa +2 more
doaj +1 more source
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source
On Ramsey (C4, K1, n)-minimal graphs
Electronic Journal of Graph Theory and Applications, 2023 Let F, G and H be any simple graphs. The notation F → (G, H) means 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. If F → (G, H), then graph F is called a Ramsey graph for (G, H).
Hilda Assiyatun +2 more
doaj +1 more source
Modular irregularity strength on some flower graphs
Electronic Journal of Graph Theory and Applications, 2023 Let G = (V(G),E(G)) be a graph with the nonempty vertex set V(G) and the edge set E(G). Let Zn be the group of integers modulo n and let k be a positive integer. A modular irregular labeling of a graph G of order n is an edge k-labeling φ : E(G)→{1, 2, …,
Kiki A. Sugeng +5 more
doaj +1 more source