Results 1 to 10 of about 6,018,593 (306)
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 +5 more sources
Graph products of groups [PDF]
, 1990 In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core +7 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
Dilation theory for rank two graph algebras. [PDF]
, 2010 An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2-graph and, more ...
Yang, Dilian +2 more
core +4 more sources
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
Confluence theory for graphs [PDF]
Algebraic & Geometric Topology, 2007 We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of graphs (via Kuperberg's spiders ...
Sikora, Adam, Westbury, Bruce
openaire +3 more sources
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