The fractional strong metric dimension in three graph products

For any two distinct vertices x and y of a graph G , let S { x , y...
Ausführliche Beschreibung

For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs. Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Kang, Cong X. [verfasserIn] Yero, Ismael G. [verfasserIn] Yi, Eunjeong [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2018

Schlagwörter:	Fractional strong metric dimension Strong metric dimension Matching number Vertex cover number Mutually maximally distant vertices Corona product Lexicographic product Cartesian product

Übergeordnetes Werk:	Enthalten in: Discrete applied mathematics - [S.l.] : Elsevier, 1979, 251, Seite 190-203
Übergeordnetes Werk:	volume:251 ; pages:190-203

DOI / URN:	10.1016/j.dam.2018.05.051

Katalog-ID:	ELV001177788

Internformat


LEADER	01000caa a22002652 4500
001	ELV001177788
003	DE-627
005	20230524162013.0
007	cr uuu---uuuuu
008	230428s2018 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1016/j.dam.2018.05.051 \|2 doi
035			\|a (DE-627)ELV001177788
035			\|a (ELSEVIER)S0166-218X(18)30312-3
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
082	0	4	\|a 510 \|q DE-600
084			\|a 31.80 \|2 bkl
084			\|a 31.12 \|2 bkl
100	1		\|a Kang, Cong X. \|e verfasserin \|4 aut
245	1	0	\|a The fractional strong metric dimension in three graph products
264		1	\|c 2018
336			\|a nicht spezifiziert \|b zzz \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs.
650		4	\|a Fractional strong metric dimension
650		4	\|a Strong metric dimension
650		4	\|a Matching number
650		4	\|a Vertex cover number
650		4	\|a Mutually maximally distant vertices
650		4	\|a Corona product
650		4	\|a Lexicographic product
650		4	\|a Cartesian product
700	1		\|a Yero, Ismael G. \|e verfasserin \|0 (orcid)0000-0002-1619-1572 \|4 aut
700	1		\|a Yi, Eunjeong \|e verfasserin \|4 aut
773	0	8	\|i Enthalten in \|t Discrete applied mathematics \|d [S.l.] : Elsevier, 1979 \|g 251, Seite 190-203 \|h Online-Ressource \|w (DE-627)266881270 \|w (DE-600)1467965-6 \|w (DE-576)078315018 \|7 nnns
773	1	8	\|g volume:251 \|g pages:190-203
912			\|a GBV_USEFLAG_U
912			\|a SYSFLAG_U
912			\|a GBV_ELV
912			\|a SSG-OPC-MAT
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_32
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_74
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_150
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_224
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2025
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2038
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2049
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2064
912			\|a GBV_ILN_2065
912			\|a GBV_ILN_2068
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2112
912			\|a GBV_ILN_2113
912			\|a GBV_ILN_2118
912			\|a GBV_ILN_2122
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_2143
912			\|a GBV_ILN_2147
912			\|a GBV_ILN_2148
912			\|a GBV_ILN_2152
912			\|a GBV_ILN_2153
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2336
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_2522
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4251
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_4326
912			\|a GBV_ILN_4333
912			\|a GBV_ILN_4334
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4393
912			\|a GBV_ILN_4700
936	b	k	\|a 31.80 \|j Angewandte Mathematik
936	b	k	\|a 31.12 \|j Kombinatorik \|j Graphentheorie
951			\|a AR
952			\|d 251 \|h 190-203

Indexfelder

author_variant	c x k cx cxk i g y ig igy e y ey
matchkey_str	kangcongxyeroismaelgyieunjeong:2018----:hfatoasrnmtidmninnh
hierarchy_sort_str	2018
bklnumber	31.80 31.12
publishDate	2018
allfields	10.1016/j.dam.2018.05.051 doi (DE-627)ELV001177788 (ELSEVIER)S0166-218X(18)30312-3 DE-627 ger DE-627 rda eng 510 DE-600 31.80 bkl 31.12 bkl Kang, Cong X. verfasserin aut The fractional strong metric dimension in three graph products 2018 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs. Fractional strong metric dimension Strong metric dimension Matching number Vertex cover number Mutually maximally distant vertices Corona product Lexicographic product Cartesian product Yero, Ismael G. verfasserin (orcid)0000-0002-1619-1572 aut Yi, Eunjeong verfasserin aut Enthalten in Discrete applied mathematics [S.l.] : Elsevier, 1979 251, Seite 190-203 Online-Ressource (DE-627)266881270 (DE-600)1467965-6 (DE-576)078315018 nnns volume:251 pages:190-203 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-MAT GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 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_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 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_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 31.80 Angewandte Mathematik 31.12 Kombinatorik Graphentheorie AR 251 190-203
spelling	10.1016/j.dam.2018.05.051 doi (DE-627)ELV001177788 (ELSEVIER)S0166-218X(18)30312-3 DE-627 ger DE-627 rda eng 510 DE-600 31.80 bkl 31.12 bkl Kang, Cong X. verfasserin aut The fractional strong metric dimension in three graph products 2018 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs. Fractional strong metric dimension Strong metric dimension Matching number Vertex cover number Mutually maximally distant vertices Corona product Lexicographic product Cartesian product Yero, Ismael G. verfasserin (orcid)0000-0002-1619-1572 aut Yi, Eunjeong verfasserin aut Enthalten in Discrete applied mathematics [S.l.] : Elsevier, 1979 251, Seite 190-203 Online-Ressource (DE-627)266881270 (DE-600)1467965-6 (DE-576)078315018 nnns volume:251 pages:190-203 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-MAT GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 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_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 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_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 31.80 Angewandte Mathematik 31.12 Kombinatorik Graphentheorie AR 251 190-203
allfields_unstemmed	10.1016/j.dam.2018.05.051 doi (DE-627)ELV001177788 (ELSEVIER)S0166-218X(18)30312-3 DE-627 ger DE-627 rda eng 510 DE-600 31.80 bkl 31.12 bkl Kang, Cong X. verfasserin aut The fractional strong metric dimension in three graph products 2018 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs. Fractional strong metric dimension Strong metric dimension Matching number Vertex cover number Mutually maximally distant vertices Corona product Lexicographic product Cartesian product Yero, Ismael G. verfasserin (orcid)0000-0002-1619-1572 aut Yi, Eunjeong verfasserin aut Enthalten in Discrete applied mathematics [S.l.] : Elsevier, 1979 251, Seite 190-203 Online-Ressource (DE-627)266881270 (DE-600)1467965-6 (DE-576)078315018 nnns volume:251 pages:190-203 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-MAT GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 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_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 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_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 31.80 Angewandte Mathematik 31.12 Kombinatorik Graphentheorie AR 251 190-203
allfieldsGer	10.1016/j.dam.2018.05.051 doi (DE-627)ELV001177788 (ELSEVIER)S0166-218X(18)30312-3 DE-627 ger DE-627 rda eng 510 DE-600 31.80 bkl 31.12 bkl Kang, Cong X. verfasserin aut The fractional strong metric dimension in three graph products 2018 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs. Fractional strong metric dimension Strong metric dimension Matching number Vertex cover number Mutually maximally distant vertices Corona product Lexicographic product Cartesian product Yero, Ismael G. verfasserin (orcid)0000-0002-1619-1572 aut Yi, Eunjeong verfasserin aut Enthalten in Discrete applied mathematics [S.l.] : Elsevier, 1979 251, Seite 190-203 Online-Ressource (DE-627)266881270 (DE-600)1467965-6 (DE-576)078315018 nnns volume:251 pages:190-203 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-MAT GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 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_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 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_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 31.80 Angewandte Mathematik 31.12 Kombinatorik Graphentheorie AR 251 190-203
allfieldsSound	10.1016/j.dam.2018.05.051 doi (DE-627)ELV001177788 (ELSEVIER)S0166-218X(18)30312-3 DE-627 ger DE-627 rda eng 510 DE-600 31.80 bkl 31.12 bkl Kang, Cong X. verfasserin aut The fractional strong metric dimension in three graph products 2018 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs. Fractional strong metric dimension Strong metric dimension Matching number Vertex cover number Mutually maximally distant vertices Corona product Lexicographic product Cartesian product Yero, Ismael G. verfasserin (orcid)0000-0002-1619-1572 aut Yi, Eunjeong verfasserin aut Enthalten in Discrete applied mathematics [S.l.] : Elsevier, 1979 251, Seite 190-203 Online-Ressource (DE-627)266881270 (DE-600)1467965-6 (DE-576)078315018 nnns volume:251 pages:190-203 GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-MAT GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 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_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 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_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700 31.80 Angewandte Mathematik 31.12 Kombinatorik Graphentheorie AR 251 190-203
language	English
source	Enthalten in Discrete applied mathematics 251, Seite 190-203 volume:251 pages:190-203
sourceStr	Enthalten in Discrete applied mathematics 251, Seite 190-203 volume:251 pages:190-203
format_phy_str_mv	Article
bklname	Angewandte Mathematik Kombinatorik Graphentheorie
institution	findex.gbv.de
topic_facet	Fractional strong metric dimension Strong metric dimension Matching number Vertex cover number Mutually maximally distant vertices Corona product Lexicographic product Cartesian product
dewey-raw	510
isfreeaccess_bool	false
container_title	Discrete applied mathematics
authorswithroles_txt_mv	Kang, Cong X. @@aut@@ Yero, Ismael G. @@aut@@ Yi, Eunjeong @@aut@@
publishDateDaySort_date	2018-01-01T00:00:00Z
hierarchy_top_id	266881270
dewey-sort	3510
id	ELV001177788
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">ELV001177788</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524162013.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230428s2018 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2018.05.051</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV001177788</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(18)30312-3</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kang, Cong X.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The fractional strong metric dimension in three graph products</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</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">For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fractional strong metric dimension</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Strong metric dimension</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matching number</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Vertex cover number</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mutually maximally distant vertices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Corona product</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lexicographic product</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cartesian product</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yero, Ismael G.</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-1619-1572</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yi, Eunjeong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Discrete applied mathematics</subfield><subfield code="d">[S.l.] : Elsevier, 1979</subfield><subfield code="g">251, Seite 190-203</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)266881270</subfield><subfield code="w">(DE-600)1467965-6</subfield><subfield code="w">(DE-576)078315018</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:251</subfield><subfield code="g">pages:190-203</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</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_32</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_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</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_100</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_150</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_224</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_370</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_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</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_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</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_4035</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_4242</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_4251</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_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</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_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.80</subfield><subfield code="j">Angewandte Mathematik</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.12</subfield><subfield code="j">Kombinatorik</subfield><subfield code="j">Graphentheorie</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">251</subfield><subfield code="h">190-203</subfield></datafield></record></collection>
author	Kang, Cong X.
spellingShingle	Kang, Cong X. ddc 510 bkl 31.80 bkl 31.12 misc Fractional strong metric dimension misc Strong metric dimension misc Matching number misc Vertex cover number misc Mutually maximally distant vertices misc Corona product misc Lexicographic product misc Cartesian product The fractional strong metric dimension in three graph products
authorStr	Kang, Cong X.
ppnlink_with_tag_str_mv	@@773@@(DE-627)266881270
format	electronic Article
dewey-ones	510 - Mathematics
delete_txt_mv	keep
author_role	aut aut aut
collection	elsevier
remote_str	true
illustrated	Not Illustrated
topic_title	510 DE-600 31.80 bkl 31.12 bkl The fractional strong metric dimension in three graph products Fractional strong metric dimension Strong metric dimension Matching number Vertex cover number Mutually maximally distant vertices Corona product Lexicographic product Cartesian product
topic	ddc 510 bkl 31.80 bkl 31.12 misc Fractional strong metric dimension misc Strong metric dimension misc Matching number misc Vertex cover number misc Mutually maximally distant vertices misc Corona product misc Lexicographic product misc Cartesian product
topic_unstemmed	ddc 510 bkl 31.80 bkl 31.12 misc Fractional strong metric dimension misc Strong metric dimension misc Matching number misc Vertex cover number misc Mutually maximally distant vertices misc Corona product misc Lexicographic product misc Cartesian product
topic_browse	ddc 510 bkl 31.80 bkl 31.12 misc Fractional strong metric dimension misc Strong metric dimension misc Matching number misc Vertex cover number misc Mutually maximally distant vertices misc Corona product misc Lexicographic product misc Cartesian product
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Discrete applied mathematics
hierarchy_parent_id	266881270
dewey-tens	510 - Mathematics
hierarchy_top_title	Discrete applied mathematics
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)266881270 (DE-600)1467965-6 (DE-576)078315018
title	The fractional strong metric dimension in three graph products
ctrlnum	(DE-627)ELV001177788 (ELSEVIER)S0166-218X(18)30312-3
title_full	The fractional strong metric dimension in three graph products
author_sort	Kang, Cong X.
journal	Discrete applied mathematics
journalStr	Discrete applied mathematics
lang_code	eng
isOA_bool	false
dewey-hundreds	500 - Science
recordtype	marc
publishDateSort	2018
contenttype_str_mv	zzz
container_start_page	190
author_browse	Kang, Cong X. Yero, Ismael G. Yi, Eunjeong
container_volume	251
class	510 DE-600 31.80 bkl 31.12 bkl
format_se	Elektronische Aufsätze
author-letter	Kang, Cong X.
doi_str_mv	10.1016/j.dam.2018.05.051
normlink	(ORCID)0000-0002-1619-1572
normlink_prefix_str_mv	(orcid)0000-0002-1619-1572
dewey-full	510
author2-role	verfasserin
title_sort	the fractional strong metric dimension in three graph products
title_auth	The fractional strong metric dimension in three graph products
abstract	For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs.
abstractGer	For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs.
abstract_unstemmed	For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs.
collection_details	GBV_USEFLAG_U SYSFLAG_U GBV_ELV SSG-OPC-MAT GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 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_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 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_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4393 GBV_ILN_4700
title_short	The fractional strong metric dimension in three graph products
remote_bool	true
author2	Yero, Ismael G. Yi, Eunjeong
author2Str	Yero, Ismael G. Yi, Eunjeong
ppnlink	266881270
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1016/j.dam.2018.05.051
up_date	2024-07-06T20:29:22.409Z
_version_	1803862946516828160
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">ELV001177788</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524162013.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230428s2018 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2018.05.051</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV001177788</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(18)30312-3</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kang, Cong X.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The fractional strong metric dimension in three graph products</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</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">For any two distinct vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y − z geodesic or y lies on an x − z geodesic. Let g : V ( G ) → [ 0 , 1 ] be a real valued function and, for any U ⊆ V ( G ) , let g ( U ) = ∑ v ∈ U g ( v ) . The function g is a strong resolving function of G if g ( S { x , y } ) ≥ 1 for every pair of distinct vertices x , y of G . The fractional strong metric dimension, sdim f ( G ) , of a graph G is min { g ( V ( G ) ) : g is a strong resolving function of G } . In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fractional strong metric dimension</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Strong metric dimension</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matching number</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Vertex cover number</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mutually maximally distant vertices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Corona product</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lexicographic product</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cartesian product</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yero, Ismael G.</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-1619-1572</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yi, Eunjeong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Discrete applied mathematics</subfield><subfield code="d">[S.l.] : Elsevier, 1979</subfield><subfield code="g">251, Seite 190-203</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)266881270</subfield><subfield code="w">(DE-600)1467965-6</subfield><subfield code="w">(DE-576)078315018</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:251</subfield><subfield code="g">pages:190-203</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</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_32</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_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</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_100</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_150</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_224</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_370</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_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</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_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</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_4035</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_4242</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_4251</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_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</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_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.80</subfield><subfield code="j">Angewandte Mathematik</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.12</subfield><subfield code="j">Kombinatorik</subfield><subfield code="j">Graphentheorie</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">251</subfield><subfield code="h">190-203</subfield></datafield></record></collection>
score	7.3991947

Nicht das Richtige dabei?

Schreiben Sie uns!

The fractional strong metric dimension in three graph products

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?