The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree
Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this pap...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Yang, Weihua [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
6 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures - Miguel, F.L. ELSEVIER, 2013transfer abstract, [S.l.] |
|---|---|
| Übergeordnetes Werk: |
volume:167 ; year:2014 ; day:20 ; month:04 ; pages:304-309 ; extent:6 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.dam.2013.10.028 |
|---|
| Katalog-ID: |
ELV027920232 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV027920232 | ||
| 003 | DE-627 | ||
| 005 | 20230625152644.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2014 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.dam.2013.10.028 |2 doi | |
| 028 | 5 | 2 | |a GBVA2014005000020.pica |
| 035 | |a (DE-627)ELV027920232 | ||
| 035 | |a (ELSEVIER)S0166-218X(13)00471-X | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 510 | |
| 082 | 0 | 4 | |a 510 |q DE-600 |
| 082 | 0 | 4 | |a 070 |q VZ |
| 082 | 0 | 4 | |a 660 |q VZ |
| 082 | 0 | 4 | |a 333.7 |a 610 |q VZ |
| 084 | |a 43.12 |2 bkl | ||
| 084 | |a 43.13 |2 bkl | ||
| 084 | |a 44.13 |2 bkl | ||
| 100 | 1 | |a Yang, Weihua |e verfasserin |4 aut | |
| 245 | 1 | 4 | |a The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree |
| 264 | 1 | |c 2014transfer abstract | |
| 300 | |a 6 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. | ||
| 520 | |a Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. | ||
| 650 | 7 | |a Edge-connectivity |2 Elsevier | |
| 650 | 7 | |a Edge–degree |2 Elsevier | |
| 650 | 7 | |a Restricted edge connectivity |2 Elsevier | |
| 650 | 7 | |a Minimum restricted edge connected graphs |2 Elsevier | |
| 650 | 7 | |a Extremal graph theory |2 Elsevier | |
| 700 | 1 | |a Tian, Yingzhi |4 oth | |
| 700 | 1 | |a Li, Hengzhe |4 oth | |
| 700 | 1 | |a Li, Hao |4 oth | |
| 700 | 1 | |a Guo, Xiaofeng |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Miguel, F.L. ELSEVIER |t Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |d 2013transfer abstract |g [S.l.] |w (DE-627)ELV011300345 |
| 773 | 1 | 8 | |g volume:167 |g year:2014 |g day:20 |g month:04 |g pages:304-309 |g extent:6 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.dam.2013.10.028 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a SSG-OPC-GGO | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_130 | ||
| 936 | b | k | |a 43.12 |j Umweltchemie |q VZ |
| 936 | b | k | |a 43.13 |j Umwelttoxikologie |q VZ |
| 936 | b | k | |a 44.13 |j Medizinische Ökologie |q VZ |
| 951 | |a AR | ||
| 952 | |d 167 |j 2014 |b 20 |c 0420 |h 304-309 |g 6 | ||
| 953 | |2 045F |a 510 | ||
| author_variant |
w y wy |
|---|---|
| matchkey_str |
yangweihuatianyingzhilihengzhelihaoguoxi:2014----:hmnmmetitddeoncegahnteiiuszoga |
| hierarchy_sort_str |
2014transfer abstract |
| bklnumber |
43.12 43.13 44.13 |
| publishDate |
2014 |
| allfields |
10.1016/j.dam.2013.10.028 doi GBVA2014005000020.pica (DE-627)ELV027920232 (ELSEVIER)S0166-218X(13)00471-X DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Yang, Weihua verfasserin aut The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree 2014transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory Elsevier Tian, Yingzhi oth Li, Hengzhe oth Li, Hao oth Guo, Xiaofeng oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:167 year:2014 day:20 month:04 pages:304-309 extent:6 https://doi.org/10.1016/j.dam.2013.10.028 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 167 2014 20 0420 304-309 6 045F 510 |
| spelling |
10.1016/j.dam.2013.10.028 doi GBVA2014005000020.pica (DE-627)ELV027920232 (ELSEVIER)S0166-218X(13)00471-X DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Yang, Weihua verfasserin aut The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree 2014transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory Elsevier Tian, Yingzhi oth Li, Hengzhe oth Li, Hao oth Guo, Xiaofeng oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:167 year:2014 day:20 month:04 pages:304-309 extent:6 https://doi.org/10.1016/j.dam.2013.10.028 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 167 2014 20 0420 304-309 6 045F 510 |
| allfields_unstemmed |
10.1016/j.dam.2013.10.028 doi GBVA2014005000020.pica (DE-627)ELV027920232 (ELSEVIER)S0166-218X(13)00471-X DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Yang, Weihua verfasserin aut The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree 2014transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory Elsevier Tian, Yingzhi oth Li, Hengzhe oth Li, Hao oth Guo, Xiaofeng oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:167 year:2014 day:20 month:04 pages:304-309 extent:6 https://doi.org/10.1016/j.dam.2013.10.028 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 167 2014 20 0420 304-309 6 045F 510 |
| allfieldsGer |
10.1016/j.dam.2013.10.028 doi GBVA2014005000020.pica (DE-627)ELV027920232 (ELSEVIER)S0166-218X(13)00471-X DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Yang, Weihua verfasserin aut The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree 2014transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory Elsevier Tian, Yingzhi oth Li, Hengzhe oth Li, Hao oth Guo, Xiaofeng oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:167 year:2014 day:20 month:04 pages:304-309 extent:6 https://doi.org/10.1016/j.dam.2013.10.028 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 167 2014 20 0420 304-309 6 045F 510 |
| allfieldsSound |
10.1016/j.dam.2013.10.028 doi GBVA2014005000020.pica (DE-627)ELV027920232 (ELSEVIER)S0166-218X(13)00471-X DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Yang, Weihua verfasserin aut The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree 2014transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory Elsevier Tian, Yingzhi oth Li, Hengzhe oth Li, Hao oth Guo, Xiaofeng oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:167 year:2014 day:20 month:04 pages:304-309 extent:6 https://doi.org/10.1016/j.dam.2013.10.028 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 167 2014 20 0420 304-309 6 045F 510 |
| language |
English |
| source |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:167 year:2014 day:20 month:04 pages:304-309 extent:6 |
| sourceStr |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:167 year:2014 day:20 month:04 pages:304-309 extent:6 |
| format_phy_str_mv |
Article |
| bklname |
Umweltchemie Umwelttoxikologie Medizinische Ökologie |
| institution |
findex.gbv.de |
| topic_facet |
Edge-connectivity Edge–degree Restricted edge connectivity Minimum restricted edge connected graphs Extremal graph theory |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| authorswithroles_txt_mv |
Yang, Weihua @@aut@@ Tian, Yingzhi @@oth@@ Li, Hengzhe @@oth@@ Li, Hao @@oth@@ Guo, Xiaofeng @@oth@@ |
| publishDateDaySort_date |
2014-01-20T00:00:00Z |
| hierarchy_top_id |
ELV011300345 |
| dewey-sort |
3510 |
| id |
ELV027920232 |
| 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">ELV027920232</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625152644.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2013.10.028</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2014005000020.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV027920232</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(13)00471-X</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="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">660</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">333.7</subfield><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yang, Weihua</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">6</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">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge-connectivity</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge–degree</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Restricted edge connectivity</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Minimum restricted edge connected graphs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Extremal graph theory</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tian, Yingzhi</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Hengzhe</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Hao</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Guo, Xiaofeng</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Miguel, F.L. ELSEVIER</subfield><subfield code="t">Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures</subfield><subfield code="d">2013transfer abstract</subfield><subfield code="g">[S.l.]</subfield><subfield code="w">(DE-627)ELV011300345</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:167</subfield><subfield code="g">year:2014</subfield><subfield code="g">day:20</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:304-309</subfield><subfield code="g">extent:6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2013.10.028</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-GGO</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_30</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.12</subfield><subfield code="j">Umweltchemie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.13</subfield><subfield code="j">Umwelttoxikologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.13</subfield><subfield code="j">Medizinische Ökologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">167</subfield><subfield code="j">2014</subfield><subfield code="b">20</subfield><subfield code="c">0420</subfield><subfield code="h">304-309</subfield><subfield code="g">6</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
| author |
Yang, Weihua |
| spellingShingle |
Yang, Weihua ddc 510 ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree |
| authorStr |
Yang, Weihua |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV011300345 |
| format |
electronic Article |
| dewey-ones |
510 - Mathematics 070 - News media, journalism & publishing 660 - Chemical engineering 333 - Economics of land & energy 610 - Medicine & health |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory Elsevier |
| topic |
ddc 510 ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory |
| topic_unstemmed |
ddc 510 ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory |
| topic_browse |
ddc 510 ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Edge-connectivity Elsevier Edge–degree Elsevier Restricted edge connectivity Elsevier Minimum restricted edge connected graphs Elsevier Extremal graph theory |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
y t yt h l hl h l hl x g xg |
| hierarchy_parent_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| hierarchy_parent_id |
ELV011300345 |
| dewey-tens |
510 - Mathematics 070 - News media, journalism & publishing 660 - Chemical engineering 330 - Economics 610 - Medicine & health |
| hierarchy_top_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV011300345 |
| title |
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree |
| ctrlnum |
(DE-627)ELV027920232 (ELSEVIER)S0166-218X(13)00471-X |
| title_full |
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree |
| author_sort |
Yang, Weihua |
| journal |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| journalStr |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science 000 - Computer science, information & general works 600 - Technology 300 - Social sciences |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
zzz |
| container_start_page |
304 |
| author_browse |
Yang, Weihua |
| container_volume |
167 |
| physical |
6 |
| class |
510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Yang, Weihua |
| doi_str_mv |
10.1016/j.dam.2013.10.028 |
| dewey-full |
510 070 660 333.7 610 |
| title_sort |
minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree |
| title_auth |
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree |
| abstract |
Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. |
| abstractGer |
Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. |
| abstract_unstemmed |
Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 |
| title_short |
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree |
| url |
https://doi.org/10.1016/j.dam.2013.10.028 |
| remote_bool |
true |
| author2 |
Tian, Yingzhi Li, Hengzhe Li, Hao Guo, Xiaofeng |
| author2Str |
Tian, Yingzhi Li, Hengzhe Li, Hao Guo, Xiaofeng |
| ppnlink |
ELV011300345 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth |
| doi_str |
10.1016/j.dam.2013.10.028 |
| up_date |
2024-07-06T17:28:00.784Z |
| _version_ |
1803851536306012160 |
| 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">ELV027920232</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625152644.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2013.10.028</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2014005000020.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV027920232</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(13)00471-X</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="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">660</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">333.7</subfield><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yang, Weihua</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">6</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">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let G = ( V ( G ) , E ( G ) ) be a graph. Determining the minimum and/or maximum size ( | E ( G ) | ) of graphs with some given parameters is a classic extremal problem in graph theory. For a graph G and e = u v ∈ E ( G ) , we denote d ( e ) = d ( u ) + d ( v ) − 2 the edge–degree of e . In this paper, we obtain a lower bound for the minimum size of graphs with a given order n , a given minimum degree δ and a given minimum edge–degree 2 δ + k − 2 . Moreover, we characterize the extremal graphs for k = 0 , 1 , 2 . As an application, we characterize some kinds of minimum restricted edge connected graphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge-connectivity</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge–degree</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Restricted edge connectivity</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Minimum restricted edge connected graphs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Extremal graph theory</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tian, Yingzhi</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Hengzhe</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Hao</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Guo, Xiaofeng</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Miguel, F.L. ELSEVIER</subfield><subfield code="t">Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures</subfield><subfield code="d">2013transfer abstract</subfield><subfield code="g">[S.l.]</subfield><subfield code="w">(DE-627)ELV011300345</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:167</subfield><subfield code="g">year:2014</subfield><subfield code="g">day:20</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:304-309</subfield><subfield code="g">extent:6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2013.10.028</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-GGO</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_30</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.12</subfield><subfield code="j">Umweltchemie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.13</subfield><subfield code="j">Umwelttoxikologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.13</subfield><subfield code="j">Medizinische Ökologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">167</subfield><subfield code="j">2014</subfield><subfield code="b">20</subfield><subfield code="c">0420</subfield><subfield code="h">304-309</subfield><subfield code="g">6</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
| score |
7.4005537 |