Filters








165,886 Hits in 4.1 sec

Integral sum graphs from identification

Zhibo Chen
1998 Discrete Mathematics  
In this paper, we first introduce some methods of identification on constructing new connected integral sum graphs from given integral sum graphs.  ...  The idea of integral sum graphs was introduced by Harary (1994) .  ...  In the present paper, we shall present some methods on constructing new connected integral sum graphs from given integral sum graphs by identification.  ... 
doi:10.1016/s0012-365x(97)00046-0 fatcat:rsliaguf75fcxiyxqsxlz4vcuq

On integral sum graphs

Zhibo Chen
2006 Discrete Mathematics  
We introduce a method of identification on constructing new connected integral sum graphs from given integral sum graphs with a saturated node.  ...  We determine the structure for all integral sum graphs with exactly two saturated nodes, and give an upper bound for the number of edges of a connected integral sum graph with no saturated nodes.  ...  In [1] we introduced some methods on constructing new connected integral sum graphs from given integral sum graphs by identification.  ... 
doi:10.1016/j.disc.2005.10.021 fatcat:me6eliqomnb4ra4kww3iftnigy

Theory of Classical Fluids: Hyper-Netted Chain Approximation. III

Tohru Morita
1960 Progress of theoretical physics  
The pair distribution function in our approximation is shown to satisfy a new integral equation, which is compared with the Yvon, Born and Green one.  ...  ZS' ZI ZI ZS' Then, the contribu~ion to be subtracted is from the graph: In the previous section, we have summed up the contribution of the graphs which can be reduced to a line or a ring by identifications  ...  Mayer 4 ) introduced graphs to illustrate the integrals in the sums of the righthand side of (2), (4) and (6) .  ... 
doi:10.1143/ptp.23.829 fatcat:h4mndlowwvfttii5c4ttgi2lcq

Page 7570 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
In the present paper the author first introduces some methods of identification for constructing new connected integral sum graphs from given integral sum graphs.  ...  The other is related to the chessboards in the theory of rook polynomials.” 98m:05171 05C78 Chen, Zhibo (1-PASK; McKeesport, PA) Integral sum graphs from identification.  ... 

On integral sum graphs with a saturated vertex

Zhibo Chen
2010 Czechoslovak Mathematical Journal  
To show a graph G is an integral sum graph, we may try to find an integral sum labeling directly, or we may use some undirect methods such as the methods of identification (see [3] , [4] , [9] and  ...  Preliminaries From now on, we use the notation G + {a 1 , a 2 , . . . , a p } to denote an (integral) sum graph with an (integral) sum graph labeling such that the vertices of G are labeled by the integers  ... 
doi:10.1007/s10587-010-0061-z fatcat:7hrdp5zbbjaavctrm7gwysgwf4

Page 1051 of None Vol. 120, Issue 3 [page]

1960 None  
A much more straightforward procedure is to sum over the + operators in each order of the iteration, so that the identification of contributions as originating from specific graphs is lost.  ...  —"/ We (=) = 32x' ( 6 Sie f f ) [The A integrals arise from one-meson, the B integrals from contributions to R,(0;q).] The contributions to the various graphs are given in Table I and Fig. 2.  ... 

Theory of Classical Fluids: Hyper-Netted Chain Approximation, I

Tohru Morita
1958 Progress of theoretical physics  
We group the latters by the graphs of junctions which are obtained from them after a sequence of identifications is applied until they come to have no identifiable lines and then the points other than  ...  We will start with graphs for which the times of identification are small and proceed to those with larger and larger times of identification.  ... 
doi:10.1143/ptp.20.920 fatcat:nqgzhgbypzfj3m77slf7dw2roa

Optimal weighting of bimodal biometric information with specific application to audio–visual person identification

Roland Hu, R.I. Damper
2009 Information Fusion  
A new method is proposed to estimate the optimal weighting parameter for combining audio (speech) and visual (face) information in person identification, based on estimating probability density functions  ...  Of all the approaches based on late integration, the simplest use some fixed fusion rule, e.g., the sum rule, product rule etc. (Kittler et al., 1998; Duin, 2002) .  ...  During identification, matching takes place by the adaptive formation of an image graph to match best a given model graph.  ... 
doi:10.1016/j.inffus.2008.08.003 fatcat:wecbvahnn5em3j6rnfupczj6b4

Detection of Infeasible Paths in Software Testing using UML Application to Gold Vending Machine

Gufran Ahmad Ansari
2017 International Journal of Education and Management Engineering  
For detection of these infeasible paths, the author builds the control flow graph from sequence diagram and then generated independent paths from it.  ...  The basis path testing approach involves generation of test cases from a set of independent paths. Each test case is forced to execute a certain test path of the control flow graph.  ...  We build the control flow graph from a sequence diagram and then generate independent paths from it.  ... 
doi:10.5815/ijeme.2017.04.03 fatcat:zvrvnvgs4reunkwzhpiop5p5yq

Theory of Classical Fluids and the Convolution Approximation (Note on Papers by Tohru Morita)

Emmanuel Meeron
1960 Progress of theoretical physics  
The convolution approximation results also from neglecting the non-convolutory terms in an exact integral equation for the pair distribution function.  ...  The limit of the nodal expansion sequence results-in an approximate integral equation for the potential of average force.  ...  and ((x) the sum of Cluster integrals defined in the same way as the integrals of the density expansions of potentials of average force, except that each line corresponds to a density dependent function  ... 
doi:10.1143/ptp.24.588 fatcat:3xpyv7xrybbfzcqkpmq6p7n3z4

Explicit Generation of Integer Solutions via CY Mfds [article]

Gordon Chalmers
2005 arXiv   pre-print
These metrics are derived from an associated algebraic curve, together with its anti-holomorphic counterpart.  ...  These coefficients can be found from the classical graph count.  ...  These identifications are found in closed form.  ... 
arXiv:physics/0509027v1 fatcat:y5pvap4pszcfpaukyg446f6qwq

Free field theory as a string theory?

Rajesh Gopakumar
2004 Comptes rendus. Physique  
We show how the relevant closed string moduli space emerges from a reorganisation of the Feynman diagrams contributing to free field correlators.  ...  Our n-point function has been expressed as a sum of contributions from the moduli space of skeleton graphs.  ...  By which we mean that we are integrating over the lengths τ of the edges of the skeleton graphs as well as summing over inequivalent skeleton graphs.  ... 
doi:10.1016/j.crhy.2004.10.004 fatcat:pmannuhf65hwbldz5hcdpick3q

Combinatorics of mapping class groups and matrix integration

C. Itzykson, J.B. Zuber
1991 Nuclear Physics B - Proceedings Supplements  
Koplik Neveu and Nussinov then suggested a drastic reduction to a zero-dimensional toy model (simple m~egrats) m order to mluers~and the purely combinatorial aspects, using techniques from graph theory  ...  It is noticeable that in a different mathematical context Penner used matrix integration to i!  ...  In the above integral expression for (t[~n] Figure 2 : 2 (a) Pair wise identification of a 2n-gon, (b) associated marguerite graph, (c) initial graph obtained by gluing the sides.  ... 
doi:10.1016/0920-5632(91)90132-x fatcat:4umeo7qf35ganav422o7ossfna

Combinatorics of Mapping Class Groups and Matrix Integration [chapter]

C. Itzykson, J. B. Zuber
1992 Quantum Mechanics of Fundamental Systems 3  
Koplik Neveu and Nussinov then suggested a drastic reduction to a zero-dimensional toy model (simple m~egrats) m order to mluers~and the purely combinatorial aspects, using techniques from graph theory  ...  It is noticeable that in a different mathematical context Penner used matrix integration to i!  ...  In the above integral expression for (t[~n] Figure 2 : 2 (a) Pair wise identification of a 2n-gon, (b) associated marguerite graph, (c) initial graph obtained by gluing the sides.  ... 
doi:10.1007/978-1-4615-3374-0_7 fatcat:erfpbbunwfhddcqaz5c73sefii

Probabilistic Framework for Integration of Mass Spectrum and Retention Time Information in Small Molecule Identification [article]

Eric Bach, Simon Rogers, John Williamson, Juho Rousu
2020 biorxiv/medrxiv   pre-print
Results: We put forward a probabilistic modelling framework to integrate MS and RT data of multiple features in an LC-MS experiment.  ...  Recently, there has been increasing interest in utilizing other information sources, such as liquid chromatography (LC) retention time (RT), to improve the MS based identifications.  ...  Comparison to other approaches In Table 2 , we compare the performance of our score-integration framework with other approaches from the literature that utilize RT information for metabolite identification  ... 
doi:10.1101/2020.08.19.255653 fatcat:uhit4cmq2zhkvmschkezkxgode
« Previous Showing results 1 — 15 out of 165,886 results