Filters
Results 1 - 10 of 13546
Results 1 - 10 of 13546.
Search took: 0.039 seconds
Sort by: date | relevance |
Sun, Weigang, E-mail: wgsun@hdu.edu.cn2013
AbstractAbstract
[en] For deterministically growing networks, it is a theoretical challenge to determine the topological properties and dynamical processes. In this paper, we study random walks on generalized Koch networks with features that include an initial state that is a globally connected network to r nodes. In each step, every existing node produces m complete graphs. We then obtain the analytical expressions for first passage time (FPT), average return time (ART), i.e. the average of FPTs for random walks from node i to return to the starting point i for the first time, and average sending time (AST), defined as the average of FPTs from a hub node to all other nodes, excluding the hub itself with regard to network parameters m and r. For this family of Koch networks, the ART of the new emerging nodes is identical and increases with the parameters m or r. In addition, the AST of our networks grows with network size N as N ln N and also increases with parameter m. The results obtained in this paper are the generalizations of random walks for the original Koch network. (paper)
Primary Subject
Source
Available from http://dx.doi.org/10.1088/0031-8949/88/04/045006; Country of input: International Atomic Energy Agency (IAEA)
Record Type
Journal Article
Journal
Physica Scripta (Online); ISSN 1402-4896;
; v. 88(4); [5 p.]

Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
Li, Wenjing; Li, Xueliang; Magnant, Colton; Zhang, Jingshu, E-mail: liwenjing610@mail.nankai.edu.cn, E-mail: lxl@nankai.edu.cn, E-mail: cmagnant@georgiasouthern.edu, E-mail: jszhang@mail.nankai.edu.cn2017
AbstractAbstract
[en] A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-colored graph is total-rainbow connected if any two vertices of the graph are connected by a path whose edges and internal vertices have distinct colors. For a connected graph G, the total-rainbow connection number of G, denoted by trc(G), is the minimum number of colors required in a total-coloring of G to make G total-rainbow connected. In this paper, we first characterize the graphs having large total-rainbow connection numbers. Based on this, we obtain a Nordhaus–Gaddum-type upper bound for the total-rainbow connection number. We prove that if G and are connected complementary graphs on n vertices, then when and when . Examples are given to show that the upper bounds are sharp for . This completely solves a conjecture in Ma (Res Math 70(1–2):173–182, 2016).
Primary Subject
Secondary Subject
Source
Copyright (c) 2017 Springer International Publishing AG, part of Springer Nature; Article Copyright (c) 2017 Springer International Publishing AG; Country of input: International Atomic Energy Agency (IAEA)
Record Type
Journal Article
Journal
Results in Mathematics; ISSN 1422-6383;
; v. 72(4); p. 2079-2100

Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
Gurau, Razvan, E-mail: rgurau@cpht.polytechnique.fr2017
AbstractAbstract
[en] A SYK–like model close to the colored tensor models has recently been proposed [1]. Building on results obtained in tensor models [2], we discuss the complete expansion of the model. We detail the two and four point functions at leading order. The leading order two point function is a sum over melonic graphs, and the leading order relevant four point functions are sums over dressed ladder diagrams. We then show that any order in the series of the two point function can be written solely in term of the leading order two and four point functions. The full expansion of arbitrary correlations can be obtained by similar methods.
Primary Subject
Source
S0550321317300299; Available from http://dx.doi.org/10.1016/j.nuclphysb.2017.01.015; © 2017 The Author(s). Published by Elsevier B.V.; Country of input: International Atomic Energy Agency (IAEA)
Record Type
Journal Article
Journal
Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
Zuev, Konstantin; Eisenberg, Or; Krioukov, Dmitri, E-mail: k.zuev@neu.edu, E-mail: eisenberg.o@husky.neu.edu, E-mail: dima@neu.edu2015
AbstractAbstract
[en] Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles subject to the constraints that the expected values of a set of graph observables are equal to given values. Here we extend these maximum-entropy ensembles to random simplicial complexes, which are more adequate and versatile constructions to model complex systems in many applications. We show that many random simplicial complex models considered in the literature can be casted as maximum-entropy ensembles under certain constraints. We introduce and analyze the most general random simplicial complex ensemble with statistically independent simplices. Our analysis is simplified by the observation that any distribution on any collection of objects including graphs and simplicial complexes, is maximum-entropy subject to the constraint that the expected value of is equal to the entropy of the distribution. With the help of this observation, we prove that ensemble is maximum-entropy subject to the two types of constraints which fix the expected numbers of simplices and their boundaries. (paper)
Primary Subject
Source
Available from http://dx.doi.org/10.1088/1751-8113/48/46/465002; Country of input: International Atomic Energy Agency (IAEA)
Record Type
Journal Article
Journal
Journal of Physics. A, Mathematical and Theoretical (Online); ISSN 1751-8121;
; v. 48(46); [25 p.]

Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
Nurdin; Ungko, T S; Gormantara, J; Abdullah, A; Aulyah, S; Nikita, E-mail: triungko@gmail.com2018
AbstractAbstract
[en] An edge-magic total labeling on a graph G is one-to-one map from V(G) ∪ E(G) onto the set of integers 1,2, ...,ν + e, where ν = |V(G)| and e = |E(G)|, with the property that, given any edge uv, f(u) + f(u, ν}) + f(ν) = k for every u,v ∈ V(G), and k is called magic valuation. An edge-magic total labeling f is called super edge-magic total if f(v(G)) = {1,2 ...,|V(G)|} and f(E(G)) = {|V(G)| + 1, |V(G)| + 2,... |V(G) + E(G)|}. In this paper we investigate edge-magic total labeling of a new graph called modified Watermill graph. Furthermore, the magic valuation of the modified Watermill graph WM(n) is , for n odd, n ≥ 3. (paper)
Primary Subject
Source
2. International Conference on Science (ICOS); Makassar (Indonesia); 2-3 Nov 2017; Available from http://dx.doi.org/10.1088/1742-6596/979/1/012067; Country of input: International Atomic Energy Agency (IAEA)
Record Type
Journal Article
Literature Type
Conference
Journal
Journal of Physics. Conference Series (Online); ISSN 1742-6596;
; v. 979(1); [9 p.]

Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
AbstractAbstract
[en] We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an algorithmic improvement, called the two-step method, for self-avoiding walk enumeration problems. We obtain significant extensions of existing series on the cubic and hypercubic lattices in all dimensions d ≥ 3: we enumerate 32-step self-avoiding polygons in d = 3, 26-step self-avoiding polygons in d = 4, 30-step self-avoiding walks in d = 3, and 24-step self-avoiding walks and polygons in all dimensions d ≥ 4. We analyze these series to obtain estimates for the connective constant and various critical exponents and amplitudes in dimensions 3 ≤ d ≤ 8. We also provide major extensions of 1/d expansions for the connective constant and for two critical amplitudes
Primary Subject
Source
S1751-8113(07)50879-6; Country of input: International Atomic Energy Agency (IAEA)
Record Type
Journal Article
Journal
Journal of Physics. A, Mathematical and Theoretical (Online); ISSN 1751-8121;
; v. 40(36); p. 10973-11017

Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
AbstractAbstract
[en] This paper is the second in a series in which we complete the description of the finite vertex stabilizers for connected graphs with projective suborbits and, as a corollary, of the vertex stabilizers for finite connected graphs in groups of automorphisms that act transitively on 2-arcs. In this part we complete the treatment of the collineation case, under the assumption that the suborbit has projective dimension 3, and of the correlation case
Primary Subject
Source
Available from http://dx.doi.org/10.1070/IM2000v064n01ABEH000278; Country of input: International Atomic Energy Agency (IAEA)
Record Type
Journal Article
Journal
Izvestiya. Mathematics; ISSN 1064-5632;
; v. 64(1); p. 173-192

Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
AbstractAbstract
[en] This paper describes a teaching method that allows for the fast and early detection of students' conceptions, misconceptions and their development. The empirical study of two examples where the method was applied is reported. The prerequisites for the efficient use of the method are discussed and results of the pilot study of its effectiveness are briefly presented
Primary Subject
Source
S0143-0807(09)88128-2; Available from http://dx.doi.org/10.1088/0143-0807/30/1/017; Country of input: International Atomic Energy Agency (IAEA)
Record Type
Journal Article
Journal
Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
Akbari, S.; Ghorbani, E.; Zare, S., E-mail: s_akbari@sina.sharif.ac.ir, E-mail: e_ghorbani@math.sharif.edu, E-mail: sa_zare_f@yahoo.com
Abdus Salam International Centre for Theoretical Physics, Trieste (Italy)2006
Abdus Salam International Centre for Theoretical Physics, Trieste (Italy)2006
AbstractAbstract
[en] The energy of a graph G is defined as the sum of the absolute values of all eigenvalues of G and denoted by E(G). Let G be a graph and rank(G) be the rank of the adjacency matrix of G. In this paper we characterize all the graphs with E(G) = rank(G). Among other results we show that apart from a few families of graphs, E(G) ≥ 2max(χ(G), n - χ(G--bar)), where G-bar and χ(G) are the complement and the chromatic number of G, respectively. Moreover some new lower bounds for E(G) in terms of rank(G) are given. (author)
Primary Subject
Source
Aug 2006; 10 p; GRANT 85160211; Also available at: http://publications.ictp.it/preprints.html; 14 refs
Record Type
Report
Report Number
Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
Akbari, S.; Nikandish, R.; Nikmehr, M.J., E-mail: s_akbari@sharif.edu, E-mail: r_nikandish@sina.kntu.ac.ir, E-mail: nikmehr@kntu.ac.ir
Abdus Salam International Centre for Theoretical Physics, Trieste (Italy)2010
Abdus Salam International Centre for Theoretical Physics, Trieste (Italy)2010
AbstractAbstract
[en] Let R be a ring with unity and I(R)* be the set of all non-trivial left ideals of R. The intersection graph of ideals of R, denoted by G(R), is a graph with the vertex set I(R)* and two distinct vertices I and J are adjacent if and only if I intersection J ≠ 0. In this paper, we study some connections between the graph-theoretic properties of this graph and some algebraic properties of rings. We characterize all rings whose intersection graphs of ideals are not connected. Also we determine all rings whose clique number of the intersection graphs of ideals are finite. Among other results, it is shown that for every ring, if the clique number of G(R) is finite, then the chromatic number is finite too and if R is a reduced ring both are equal. (author)
Primary Subject
Source
Aug 2010; 12 p; Also available at: http://users.ictp.it/~pub_off/preprints-sources/2010/IC2010074P.pdf; 15 refs
Record Type
Report
Report Number
Country of publication
Reference NumberReference Number
INIS VolumeINIS Volume
INIS IssueINIS Issue
1 | 2 | 3 | Next |