The m-order connectivity index (G) m of a graph G is     1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i m d d d  G where 1 2 1 ... i i im d d d  runs over all paths of length m in G and i d denotes the degree of vertex i v . Also,        1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i ms d d d X G is its m-sum connectivity index. A dendrimer is an artificially manufactured or synth...

njuLink is a tool designed for instance matching. It mainly matches instances by finding discriminative property pairs. Also, to meet 1:1 equivalence relationship for the OAEI 2017 DORUMES task, we make several improvements. In this report, we describe the design ideas and show our evaluation results. 1 Presentation of the System 1.1 State, purpose, general statement With the rapid development ...

s i n c e t h e l a t e 1960s, s e v e r a l c o n s t i t u t i v e m o d e l s h a v e b e e n d e v e l o p e d f o r s a n d s d e s c r i b i n g t h e i r s t r e s s-s t r a i n e h a v i o r. m o s t o f t h e s e m o d e l s w e r e e s t a b l i s h e d b a s e d o n a m e a s u r e o f t h e p l a s t i c w o r k a n d s o m e y i e l d c r i t e r i a, a m o n g t h e m b e i n g t ...

0

r p c h v t … h p q p f q r t „ i b h b c q v r „ r v q p q b t c t … ‡ t w g f v c f p q b t c f ¹ p c w p c p a g f b f t … … p ˆ b a g … ¸ c h q b t c b c µ t … p f q i ˆ p q b h „ p q b v c q f † Ä c q v r c p q b t c p a Å v ¸ r t „ f g h i b p q r b h Ä c q v r ¶ b v ‚ ¹ e t a b f i ¶ v r f b t c AE † Ç † Ç † ¹ e p c b h p c w ‰ µ t r p „ i t ‡ b p à h p a v È e ‰ Ã É ¹ ´ i v Ê t w g à v ...

A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...