The Sanskruti index of trees and unicyclic graphs

The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align*}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align*}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Deng Fei [verfasserIn] Jiang Huiqin [verfasserIn] Liu Jia-Bao [verfasserIn] Poklukar Darja Rupnik [verfasserIn] Shao Zehui [verfasserIn] Wu Pu [verfasserIn] Žerovnik Janez [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2019

Schlagwörter:	topological index molecular descriptor sanskruti index tree unicyclic graph 05c90 05c05 92e10

Übergeordnetes Werk:	In: Open Chemistry - De Gruyter, 2015, 17(2019), 1, Seite 448-455
Übergeordnetes Werk:	volume:17 ; year:2019 ; number:1 ; pages:448-455

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1515/chem-2019-0046

Katalog-ID:	DOAJ054454042

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ054454042
003	DE-627
005	20230503073043.0
007	cr uuu---uuuuu
008	230227s2019 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1515/chem-2019-0046 \|2 doi
035			\|a (DE-627)DOAJ054454042
035			\|a (DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a QD1-999
100	0		\|a Deng Fei \|e verfasserin \|4 aut
245	1	4	\|a The Sanskruti index of trees and unicyclic graphs
264		1	\|c 2019
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors.
650		4	\|a topological index
650		4	\|a molecular descriptor
650		4	\|a sanskruti index
650		4	\|a tree
650		4	\|a unicyclic graph
650		4	\|a 05c90
650		4	\|a 05c05
650		4	\|a 92e10
653		0	\|a Chemistry
700	0		\|a Jiang Huiqin \|e verfasserin \|4 aut
700	0		\|a Liu Jia-Bao \|e verfasserin \|4 aut
700	0		\|a Poklukar Darja Rupnik \|e verfasserin \|4 aut
700	0		\|a Shao Zehui \|e verfasserin \|4 aut
700	0		\|a Wu Pu \|e verfasserin \|4 aut
700	0		\|a Žerovnik Janez \|e verfasserin \|4 aut
773	0	8	\|i In \|t Open Chemistry \|d De Gruyter, 2015 \|g 17(2019), 1, Seite 448-455 \|w (DE-627)827923813 \|w (DE-600)2825411-9 \|x 23915420 \|7 nnns
773	1	8	\|g volume:17 \|g year:2019 \|g number:1 \|g pages:448-455
856	4	0	\|u https://doi.org/10.1515/chem-2019-0046 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40 \|z kostenfrei
856	4	0	\|u https://doi.org/10.1515/chem-2019-0046 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2391-5420 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a SSG-OLC-PHA
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 17 \|j 2019 \|e 1 \|h 448-455

Indexfelder

author_variant	d f df j h jh l j b ljb p d r pdr s z sz w p wp ž j žj
matchkey_str	article:23915420:2019----::hsnkuineotesnui
hierarchy_sort_str	2019
callnumber-subject-code	QD
publishDate	2019
allfields	10.1515/chem-2019-0046 doi (DE-627)DOAJ054454042 (DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40 DE-627 ger DE-627 rakwb eng QD1-999 Deng Fei verfasserin aut The Sanskruti index of trees and unicyclic graphs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors. topological index molecular descriptor sanskruti index tree unicyclic graph 05c90 05c05 92e10 Chemistry Jiang Huiqin verfasserin aut Liu Jia-Bao verfasserin aut Poklukar Darja Rupnik verfasserin aut Shao Zehui verfasserin aut Wu Pu verfasserin aut Žerovnik Janez verfasserin aut In Open Chemistry De Gruyter, 2015 17(2019), 1, Seite 448-455 (DE-627)827923813 (DE-600)2825411-9 23915420 nnns volume:17 year:2019 number:1 pages:448-455 https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40 kostenfrei https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/toc/2391-5420 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 17 2019 1 448-455
spelling	10.1515/chem-2019-0046 doi (DE-627)DOAJ054454042 (DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40 DE-627 ger DE-627 rakwb eng QD1-999 Deng Fei verfasserin aut The Sanskruti index of trees and unicyclic graphs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors. topological index molecular descriptor sanskruti index tree unicyclic graph 05c90 05c05 92e10 Chemistry Jiang Huiqin verfasserin aut Liu Jia-Bao verfasserin aut Poklukar Darja Rupnik verfasserin aut Shao Zehui verfasserin aut Wu Pu verfasserin aut Žerovnik Janez verfasserin aut In Open Chemistry De Gruyter, 2015 17(2019), 1, Seite 448-455 (DE-627)827923813 (DE-600)2825411-9 23915420 nnns volume:17 year:2019 number:1 pages:448-455 https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40 kostenfrei https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/toc/2391-5420 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 17 2019 1 448-455
allfields_unstemmed	10.1515/chem-2019-0046 doi (DE-627)DOAJ054454042 (DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40 DE-627 ger DE-627 rakwb eng QD1-999 Deng Fei verfasserin aut The Sanskruti index of trees and unicyclic graphs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors. topological index molecular descriptor sanskruti index tree unicyclic graph 05c90 05c05 92e10 Chemistry Jiang Huiqin verfasserin aut Liu Jia-Bao verfasserin aut Poklukar Darja Rupnik verfasserin aut Shao Zehui verfasserin aut Wu Pu verfasserin aut Žerovnik Janez verfasserin aut In Open Chemistry De Gruyter, 2015 17(2019), 1, Seite 448-455 (DE-627)827923813 (DE-600)2825411-9 23915420 nnns volume:17 year:2019 number:1 pages:448-455 https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40 kostenfrei https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/toc/2391-5420 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 17 2019 1 448-455
allfieldsGer	10.1515/chem-2019-0046 doi (DE-627)DOAJ054454042 (DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40 DE-627 ger DE-627 rakwb eng QD1-999 Deng Fei verfasserin aut The Sanskruti index of trees and unicyclic graphs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors. topological index molecular descriptor sanskruti index tree unicyclic graph 05c90 05c05 92e10 Chemistry Jiang Huiqin verfasserin aut Liu Jia-Bao verfasserin aut Poklukar Darja Rupnik verfasserin aut Shao Zehui verfasserin aut Wu Pu verfasserin aut Žerovnik Janez verfasserin aut In Open Chemistry De Gruyter, 2015 17(2019), 1, Seite 448-455 (DE-627)827923813 (DE-600)2825411-9 23915420 nnns volume:17 year:2019 number:1 pages:448-455 https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40 kostenfrei https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/toc/2391-5420 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 17 2019 1 448-455
allfieldsSound	10.1515/chem-2019-0046 doi (DE-627)DOAJ054454042 (DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40 DE-627 ger DE-627 rakwb eng QD1-999 Deng Fei verfasserin aut The Sanskruti index of trees and unicyclic graphs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors. topological index molecular descriptor sanskruti index tree unicyclic graph 05c90 05c05 92e10 Chemistry Jiang Huiqin verfasserin aut Liu Jia-Bao verfasserin aut Poklukar Darja Rupnik verfasserin aut Shao Zehui verfasserin aut Wu Pu verfasserin aut Žerovnik Janez verfasserin aut In Open Chemistry De Gruyter, 2015 17(2019), 1, Seite 448-455 (DE-627)827923813 (DE-600)2825411-9 23915420 nnns volume:17 year:2019 number:1 pages:448-455 https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40 kostenfrei https://doi.org/10.1515/chem-2019-0046 kostenfrei https://doaj.org/toc/2391-5420 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 17 2019 1 448-455
language	English
source	In Open Chemistry 17(2019), 1, Seite 448-455 volume:17 year:2019 number:1 pages:448-455
sourceStr	In Open Chemistry 17(2019), 1, Seite 448-455 volume:17 year:2019 number:1 pages:448-455
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	topological index molecular descriptor sanskruti index tree unicyclic graph 05c90 05c05 92e10 Chemistry
isfreeaccess_bool	true
container_title	Open Chemistry
authorswithroles_txt_mv	Deng Fei @@aut@@ Jiang Huiqin @@aut@@ Liu Jia-Bao @@aut@@ Poklukar Darja Rupnik @@aut@@ Shao Zehui @@aut@@ Wu Pu @@aut@@ Žerovnik Janez @@aut@@
publishDateDaySort_date	2019-01-01T00:00:00Z
hierarchy_top_id	827923813
id	DOAJ054454042
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ054454042</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503073043.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230227s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/chem-2019-0046</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ054454042</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QD1-999</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Deng Fei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The Sanskruti index of trees and unicyclic graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">topological index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">molecular descriptor</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">sanskruti index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">tree</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">unicyclic graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05c90</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05c05</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">92e10</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Chemistry</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jiang Huiqin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Liu Jia-Bao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Poklukar Darja Rupnik</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shao Zehui</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Wu Pu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Žerovnik Janez</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Open Chemistry</subfield><subfield code="d">De Gruyter, 2015</subfield><subfield code="g">17(2019), 1, Seite 448-455</subfield><subfield code="w">(DE-627)827923813</subfield><subfield code="w">(DE-600)2825411-9</subfield><subfield code="x">23915420</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:17</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:448-455</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/chem-2019-0046</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/chem-2019-0046</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2391-5420</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">17</subfield><subfield code="j">2019</subfield><subfield code="e">1</subfield><subfield code="h">448-455</subfield></datafield></record></collection>
callnumber-first	Q - Science
author	Deng Fei
spellingShingle	Deng Fei misc QD1-999 misc topological index misc molecular descriptor misc sanskruti index misc tree misc unicyclic graph misc 05c90 misc 05c05 misc 92e10 misc Chemistry The Sanskruti index of trees and unicyclic graphs
authorStr	Deng Fei
ppnlink_with_tag_str_mv	@@773@@(DE-627)827923813
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	QD1-999
illustrated	Not Illustrated
issn	23915420
topic_title	QD1-999 The Sanskruti index of trees and unicyclic graphs topological index molecular descriptor sanskruti index tree unicyclic graph 05c90 05c05 92e10
topic	misc QD1-999 misc topological index misc molecular descriptor misc sanskruti index misc tree misc unicyclic graph misc 05c90 misc 05c05 misc 92e10 misc Chemistry
topic_unstemmed	misc QD1-999 misc topological index misc molecular descriptor misc sanskruti index misc tree misc unicyclic graph misc 05c90 misc 05c05 misc 92e10 misc Chemistry
topic_browse	misc QD1-999 misc topological index misc molecular descriptor misc sanskruti index misc tree misc unicyclic graph misc 05c90 misc 05c05 misc 92e10 misc Chemistry
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Open Chemistry
hierarchy_parent_id	827923813
hierarchy_top_title	Open Chemistry
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)827923813 (DE-600)2825411-9
title	The Sanskruti index of trees and unicyclic graphs
ctrlnum	(DE-627)DOAJ054454042 (DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40
title_full	The Sanskruti index of trees and unicyclic graphs
author_sort	Deng Fei
journal	Open Chemistry
journalStr	Open Chemistry
callnumber-first-code	Q
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2019
contenttype_str_mv	txt
container_start_page	448
author_browse	Deng Fei Jiang Huiqin Liu Jia-Bao Poklukar Darja Rupnik Shao Zehui Wu Pu Žerovnik Janez
container_volume	17
class	QD1-999
format_se	Elektronische Aufsätze
author-letter	Deng Fei
doi_str_mv	10.1515/chem-2019-0046
author2-role	verfasserin
title_sort	sanskruti index of trees and unicyclic graphs
callnumber	QD1-999
title_auth	The Sanskruti index of trees and unicyclic graphs
abstract	The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors.
abstractGer	The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors.
abstract_unstemmed	The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	1
title_short	The Sanskruti index of trees and unicyclic graphs
url	https://doi.org/10.1515/chem-2019-0046 https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40 https://doaj.org/toc/2391-5420
remote_bool	true
author2	Jiang Huiqin Liu Jia-Bao Poklukar Darja Rupnik Shao Zehui Wu Pu Žerovnik Janez
author2Str	Jiang Huiqin Liu Jia-Bao Poklukar Darja Rupnik Shao Zehui Wu Pu Žerovnik Janez
ppnlink	827923813
callnumber-subject	QD - Chemistry
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1515/chem-2019-0046
callnumber-a	QD1-999
up_date	2024-07-03T23:11:51.109Z
_version_	1803601377871527936
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ054454042</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503073043.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230227s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/chem-2019-0046</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ054454042</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ3c25535212664e628f2efe20ddbe3d40</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QD1-999</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Deng Fei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The Sanskruti index of trees and unicyclic graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align}$$where sG(u) is the sum of the degrees of the neighbors of a vertex u in G. Let Pn, Cn, Sn and Sn + e be the path, cycle, star and star plus an edge of n vertices, respectively. The Sanskruti index of a molecular graph of a compounds can model the bioactivity of compounds, has a strong correlation with entropy of octane isomers and its prediction power is higher than many existing topological descriptors.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">topological index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">molecular descriptor</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">sanskruti index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">tree</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">unicyclic graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05c90</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05c05</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">92e10</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Chemistry</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jiang Huiqin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Liu Jia-Bao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Poklukar Darja Rupnik</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shao Zehui</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Wu Pu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Žerovnik Janez</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Open Chemistry</subfield><subfield code="d">De Gruyter, 2015</subfield><subfield code="g">17(2019), 1, Seite 448-455</subfield><subfield code="w">(DE-627)827923813</subfield><subfield code="w">(DE-600)2825411-9</subfield><subfield code="x">23915420</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:17</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:448-455</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/chem-2019-0046</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/chem-2019-0046</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2391-5420</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">17</subfield><subfield code="j">2019</subfield><subfield code="e">1</subfield><subfield code="h">448-455</subfield></datafield></record></collection>
score	7.3975964

Nicht das Richtige dabei?

Schreiben Sie uns!

The Sanskruti index of trees and unicyclic graphs

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?