Matching preclusion for direct product of regular graphs
Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super mat...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Lin, Ruizhi [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2020transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
10 |
|---|
| Ü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:277 ; year:2020 ; day:30 ; month:04 ; pages:221-230 ; extent:10 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.dam.2019.08.016 |
|---|
| Katalog-ID: |
ELV049755749 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV049755749 | ||
| 003 | DE-627 | ||
| 005 | 20230626025041.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 200518s2020 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.dam.2019.08.016 |2 doi | |
| 028 | 5 | 2 | |a /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000000947.pica |
| 035 | |a (DE-627)ELV049755749 | ||
| 035 | |a (ELSEVIER)S0166-218X(19)30389-0 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 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 Lin, Ruizhi |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Matching preclusion for direct product of regular graphs |
| 264 | 1 | |c 2020transfer abstract | |
| 300 | |a 10 | ||
| 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 be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. | ||
| 520 | |a Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. | ||
| 650 | 7 | |a Direct product |2 Elsevier | |
| 650 | 7 | |a Strong product |2 Elsevier | |
| 650 | 7 | |a Matching preclusion |2 Elsevier | |
| 650 | 7 | |a Super matched |2 Elsevier | |
| 650 | 7 | |a Maximally matched |2 Elsevier | |
| 650 | 7 | |a Regular graph |2 Elsevier | |
| 700 | 1 | |a Zhang, Heping |4 oth | |
| 700 | 1 | |a Zhao, Weisheng |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:277 |g year:2020 |g day:30 |g month:04 |g pages:221-230 |g extent:10 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.dam.2019.08.016 |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 277 |j 2020 |b 30 |c 0430 |h 221-230 |g 10 | ||
| author_variant |
r l rl |
|---|---|
| matchkey_str |
linruizhizhanghepingzhaoweisheng:2020----:acigrcuinodrcpoutf |
| hierarchy_sort_str |
2020transfer abstract |
| bklnumber |
43.12 43.13 44.13 |
| publishDate |
2020 |
| allfields |
10.1016/j.dam.2019.08.016 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000000947.pica (DE-627)ELV049755749 (ELSEVIER)S0166-218X(19)30389-0 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Lin, Ruizhi verfasserin aut Matching preclusion for direct product of regular graphs 2020transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph Elsevier Zhang, Heping oth Zhao, Weisheng 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:277 year:2020 day:30 month:04 pages:221-230 extent:10 https://doi.org/10.1016/j.dam.2019.08.016 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 277 2020 30 0430 221-230 10 |
| spelling |
10.1016/j.dam.2019.08.016 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000000947.pica (DE-627)ELV049755749 (ELSEVIER)S0166-218X(19)30389-0 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Lin, Ruizhi verfasserin aut Matching preclusion for direct product of regular graphs 2020transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph Elsevier Zhang, Heping oth Zhao, Weisheng 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:277 year:2020 day:30 month:04 pages:221-230 extent:10 https://doi.org/10.1016/j.dam.2019.08.016 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 277 2020 30 0430 221-230 10 |
| allfields_unstemmed |
10.1016/j.dam.2019.08.016 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000000947.pica (DE-627)ELV049755749 (ELSEVIER)S0166-218X(19)30389-0 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Lin, Ruizhi verfasserin aut Matching preclusion for direct product of regular graphs 2020transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph Elsevier Zhang, Heping oth Zhao, Weisheng 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:277 year:2020 day:30 month:04 pages:221-230 extent:10 https://doi.org/10.1016/j.dam.2019.08.016 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 277 2020 30 0430 221-230 10 |
| allfieldsGer |
10.1016/j.dam.2019.08.016 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000000947.pica (DE-627)ELV049755749 (ELSEVIER)S0166-218X(19)30389-0 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Lin, Ruizhi verfasserin aut Matching preclusion for direct product of regular graphs 2020transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph Elsevier Zhang, Heping oth Zhao, Weisheng 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:277 year:2020 day:30 month:04 pages:221-230 extent:10 https://doi.org/10.1016/j.dam.2019.08.016 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 277 2020 30 0430 221-230 10 |
| allfieldsSound |
10.1016/j.dam.2019.08.016 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000000947.pica (DE-627)ELV049755749 (ELSEVIER)S0166-218X(19)30389-0 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Lin, Ruizhi verfasserin aut Matching preclusion for direct product of regular graphs 2020transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph Elsevier Zhang, Heping oth Zhao, Weisheng 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:277 year:2020 day:30 month:04 pages:221-230 extent:10 https://doi.org/10.1016/j.dam.2019.08.016 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 277 2020 30 0430 221-230 10 |
| language |
English |
| source |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:277 year:2020 day:30 month:04 pages:221-230 extent:10 |
| sourceStr |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:277 year:2020 day:30 month:04 pages:221-230 extent:10 |
| format_phy_str_mv |
Article |
| bklname |
Umweltchemie Umwelttoxikologie Medizinische Ökologie |
| institution |
findex.gbv.de |
| topic_facet |
Direct product Strong product Matching preclusion Super matched Maximally matched Regular graph |
| dewey-raw |
070 |
| isfreeaccess_bool |
false |
| container_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| authorswithroles_txt_mv |
Lin, Ruizhi @@aut@@ Zhang, Heping @@oth@@ Zhao, Weisheng @@oth@@ |
| publishDateDaySort_date |
2020-01-30T00:00:00Z |
| hierarchy_top_id |
ELV011300345 |
| dewey-sort |
270 |
| id |
ELV049755749 |
| 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">ELV049755749</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626025041.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">200518s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2019.08.016</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000000947.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV049755749</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(19)30389-0</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="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">Lin, Ruizhi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Matching preclusion for direct product of regular graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</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 be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Direct product</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Strong product</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matching preclusion</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Super matched</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Maximally matched</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Regular graph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Heping</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Weisheng</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:277</subfield><subfield code="g">year:2020</subfield><subfield code="g">day:30</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:221-230</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2019.08.016</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">277</subfield><subfield code="j">2020</subfield><subfield code="b">30</subfield><subfield code="c">0430</subfield><subfield code="h">221-230</subfield><subfield code="g">10</subfield></datafield></record></collection>
|
| author |
Lin, Ruizhi |
| spellingShingle |
Lin, Ruizhi ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph Matching preclusion for direct product of regular graphs |
| authorStr |
Lin, Ruizhi |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV011300345 |
| format |
electronic Article |
| dewey-ones |
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 |
070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Matching preclusion for direct product of regular graphs Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph Elsevier |
| topic |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph |
| topic_unstemmed |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph |
| topic_browse |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Direct product Elsevier Strong product Elsevier Matching preclusion Elsevier Super matched Elsevier Maximally matched Elsevier Regular graph |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
h z hz w z wz |
| hierarchy_parent_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| hierarchy_parent_id |
ELV011300345 |
| dewey-tens |
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 |
Matching preclusion for direct product of regular graphs |
| ctrlnum |
(DE-627)ELV049755749 (ELSEVIER)S0166-218X(19)30389-0 |
| title_full |
Matching preclusion for direct product of regular graphs |
| author_sort |
Lin, Ruizhi |
| 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 |
000 - Computer science, information & general works 600 - Technology 300 - Social sciences |
| recordtype |
marc |
| publishDateSort |
2020 |
| contenttype_str_mv |
zzz |
| container_start_page |
221 |
| author_browse |
Lin, Ruizhi |
| container_volume |
277 |
| physical |
10 |
| class |
070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Lin, Ruizhi |
| doi_str_mv |
10.1016/j.dam.2019.08.016 |
| dewey-full |
070 660 333.7 610 |
| title_sort |
matching preclusion for direct product of regular graphs |
| title_auth |
Matching preclusion for direct product of regular graphs |
| abstract |
Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. |
| abstractGer |
Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. |
| abstract_unstemmed |
Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched. |
| 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 |
Matching preclusion for direct product of regular graphs |
| url |
https://doi.org/10.1016/j.dam.2019.08.016 |
| remote_bool |
true |
| author2 |
Zhang, Heping Zhao, Weisheng |
| author2Str |
Zhang, Heping Zhao, Weisheng |
| ppnlink |
ELV011300345 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1016/j.dam.2019.08.016 |
| up_date |
2024-07-06T22:26:21.126Z |
| _version_ |
1803870306176073728 |
| 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">ELV049755749</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626025041.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">200518s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2019.08.016</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000000947.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV049755749</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(19)30389-0</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="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">Lin, Ruizhi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Matching preclusion for direct product of regular graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</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 be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super matched if every optimal matching preclusion set of G consists of edges incident to a single vertex. In this paper, we focus on matching preclusion for direct product of graphs. For any two graphs G and H , we denote their direct product by G × H and show m p ( G × H ) ⩾ m p ( G ) m p ( H ) , which implies that the direct product of two maximally matched graphs is also maximally matched. Furthermore, for any two regular graphs with at least three vertices, we show that if at least one of them is maximally matched, then their direct product is super matched, and as a consequence, their strong product is also super matched.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Direct product</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Strong product</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matching preclusion</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Super matched</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Maximally matched</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Regular graph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Heping</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Weisheng</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:277</subfield><subfield code="g">year:2020</subfield><subfield code="g">day:30</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:221-230</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2019.08.016</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">277</subfield><subfield code="j">2020</subfield><subfield code="b">30</subfield><subfield code="c">0430</subfield><subfield code="h">221-230</subfield><subfield code="g">10</subfield></datafield></record></collection>
|
| score |
7.401457 |