Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Problems of Information Transmission
Erschienen in: Problems of Information Transmission 3/2020

01.07.2020 | Large Systems

Research on Fractional Critical Covered Graphs

verfasst von: S. Wang, W. Zhang

Erschienen in: Problems of Information Transmission | Ausgabe 3/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A graph G is called a fractional (g, f)-covered graph if for any e ∈ E(G), G admits a fractional (g, f)-factor covering e. A graph G is called a fractional (g, f, n)-critical covered graph if for any S ⊆ V(G) with ∣S∣ = n, G − S is a fractional (g, f)-covered graph. A fractional (g, f, n)-critical covered graph is said to be a fractional (a, b, n)-critical covered graph if g(x) = a and f(x) = b for every x ∈ V(G). A fractional (a, b, n)-critical covered graph was first defined and studied in [1]. In this article, we investigate fractional (g, f, n)-critical covered graphs and present a binding number condition for the existence of fractional (g, f, n)-critical covered graphs, which is an improvement and generalization of a previous result obtained in [2].
Vorheriger Artikel On Geometric Goppa Codes from Elementary Abelian p-Extensions of
Nächster Artikel Gaussian Two-Armed Bandit: Limiting Description

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
1.
Zhou, S., Xu, Y., and Sun, Z., Degree Conditions for Fractional (a,b,k)-Critical Covered Graphs, Inform. Process. Lett., 2019, vol. 152, Article 105838 (5 pp.).
2.
Yuan, Y. and Hao, R.-X., Neighborhood Union Conditions for Fractional [a, b]-Covered Graphs, Bull. Malays. Math. Sci. Soc., 2020, vol. 43, no. 1, pp. 157–167.MathSciNetCrossRef
3.
Liu, G. and Zhang, L., Characterizations of Maximum Fractional (g, f)-Factors of Graphs, Discrete Appl. Math., 2008, vol. 156, no. 12, pp. 2293–2299.MathSciNetCrossRef
4.
Belck, H.-B., Reguläre Faktoren von Graphen, J. Reine Angew. Math., 1950, vol. 188, pp. 228–252.MathSciNetMATH
5.
Enomoto, H., Jackson, B., Katerinis, P., and Satio, A., Toughness and the Existence of k-Factors, J. Graph Theory, 1957, vol. 9, no. 1, pp. 87–95.MathSciNetCrossRef
6.
Katerinis, P. and Woodall, D.R., Binding Numbers of Graphs and the Existence of k-Factors, Quart. J. Math. Oxford Ser. (2), 1987, vol. 38, no. 150, pp. 221–228.MathSciNetCrossRef
7.
Plummer, M.D. and Saito, A., Toughness, Binding Number and Restricted Matching Extension in a Graph, Discrete Math., 2017, vol. 340, no. 11, pp. 2665–2672.MathSciNetCrossRef
8.
Kano, M. and Tokushige, N., Binding Numbers and f-Factors of Graphs, J. Combin. Theory Ser. B, 1992, vol. 54, no. 2, pp. 213–221.MathSciNetCrossRef
9.
Cymer, R. and Kano, M., Generalizations of Marriage Theorem for Degree Factors, Graphs Combin., 2016, vol. 32, no. 6, pp. 2315–2322 (2016).MathSciNetCrossRef
10.
11.
Egawa, Y. and Kano, M., Sufficient Conditions for Graphs to Have (g, f)-Factors, Discrete Math., 1996, vol. 151, no. 1–3, pp. 87–90.MathSciNetCrossRef
12.
Matsuda, H., A Neighborhood Condition for Graphs to Have [a, b]-Factors, Discrete Math., vol. 224, no. 1–3, pp. 289–292.MathSciNetCrossRef
13.
Kouider, M. and Ouatiki, S., Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph, Graphs Combin., 2013, vol. 29, no. 4, pp. 1051–1057.MathSciNetCrossRef
14.
Zhou, S., Zhang, T., and Xu, Z., Subgraphs with Orthogonal Factorizations in Graphs, Discrete Appl. Math., vol. 286, pp. 29–34.MathSciNetCrossRef
15.
Zhou, S. and Sun, Z., Binding Number Conditions for P≥2-Factor and P≥3-Factor Uniform Graphs, Discrete Math., 2020, vol. 343, no. 3, Article 111715 (6 pp.).
16.
Zhou, S.Z. and Sun, Z.R., Some Existence Theorems on Path Factors with Given Properties in Graphs, Acta Math. Sin. (Engl. Ser.), 2020, vol. 36, no. 8, pp. 917–928.MathSciNetCrossRef
17.
Liu, G.Z., On (g, f)-Covered Graphs, Acta Math. Sci. (English Ed.), 1988, vol. 8, no. 2, pp. 181–184.
18.
Anstee, R.P., An Algorithmic Proof of Tutte’s f-Factor Theorem, J. Algorithms, 1985, vol. 6, no. 1, pp. 112–131.MathSciNetCrossRef
19.
Liu, G. and Zhang, L., Toughness and the Existence of Fractional k-Factors of Graphs, Discrete Math., 2008, vol. 308, no. 9, pp. 1741–1748.MathSciNetCrossRef
20.
Katerinis, P., Fractional ℓ-Factors in Regular Graphs, Australas. J. Combin., 2019, vol. 73, Part 3, pp. 432–439.MathSciNetMATH
21.
Zhou, S., Sun, Z., and Ye, H., A Toughness Condition for Fractional (k, m)-Deleted Graphs, Inform. Process. Lett., 2013, vol. 113, no. 8, pp. 255–259.MathSciNetCrossRef
22.
Gao, W., Wang, W.F. and Guirao, J.L.G., The Extension Degree Conditions for Fractional Factor, Acta Math. Sin. (Engl. Ser.), 2020, vol. 36, no. 3, pp. 305–317.MathSciNetCrossRef
23.
Zhou, S., Xu, L., and Xu, Z., Remarks on Fractional ID-k-Factor-Critical Graphs, Acta Math. Appl. Sin. Engl. Ser., 2019, vol. 35, no. 2, pp. 458–464.MathSciNetCrossRef
24.
Yuan, Y. and Hao, R.-X., Toughness Condition for the Existence of All Fractional (a, b, k)-Critical Graphs, Discrete Math., 2019, vol. 342, no. 8, pp. 2308–2314.MathSciNetCrossRef
25.
Lu, H. and Yu, Q., General Fractional f-Factor Numbers of Graphs, Appl. Math. Lett., 2011, vol. 24, no. 4, pp. 519–523.MathSciNetCrossRef
26.
Li, Z., Yan, G., and Zhang, X., On Fractional (g, f)-Covered Graphs, OR Trans. (in Chinese), 2002, vol. 6, no. 4, pp. 65–68.
27.
Zhou, S., Wu, J., and Liu, H., Independence Number and Connectivity for Fractional (a, b, k)-Critical Covered Graphs, arXiv:1909.01070[math.CO], 2019.
28.
Lv, X., A Degree Condition for Fractional (g, f, n)-Critical Covered Graphs, AIMS Math., 2020, vol. 5, no. 2, pp. 872–878.MathSciNetCrossRef
29.
Zhou, S., Remarks on Orthogonal Factorizations of Digraphs, Int. J. Comput. Math., 2014, vol. 91, no. 10, pp. 2109–2117.MathSciNetCrossRef
30.
Zhou, S., Sun, Z., and Xu, Z., A Result on r-Orthogonal Factorizations in Digraphs, European J. Combin., 2017, vol. 65, pp. 15–23.MathSciNetCrossRef
31.
Zhou, S., Sun, Z., and Liu, H., Sun Toughness and P≥3-Factors in Graphs, Contrib. Discrete Math., 2019, vol. 14, no. 1, pp. 167–174.MathSciNet
32.
Zhou, S., Yang, F., and Xu, L., Two Sufficient Conditions for the Existence of Path Factors in Graphs, Sci. Iran. D: Comput. Sci. Eng. Electr. Eng., 2019, vol. 26, no. 6, pp. 3510–3514.
33.
Zhou, S., Remarks on Path Factors in Graphs, RAIRO—Oper. Res., 2020, vol. 54, no. 6, pp. 1827–1834.MathSciNetCrossRef
Metadaten
Titel
Research on Fractional Critical Covered Graphs
verfasst von
S. Wang
W. Zhang
Publikationsdatum
01.07.2020
Verlag
Pleiades Publishing
Erschienen in
Problems of Information Transmission / Ausgabe 3/2020
Print ISSN: 0032-9460
Elektronische ISSN: 1608-3253
DOI
https://doi.org/10.1134/S0032946020030047

Weitere Artikel der Ausgabe 3/2020

Problems of Information Transmission 3/2020 Zur Ausgabe

Coding Theory

Symmetric Block Designs and Optimal Equidistant Codes

Automata Theory

Gaussian Two-Armed Bandit: Limiting Description

Information Theory

The Sphere Packing Bound for Memoryless Channels

Coding Theory

On Geometric Goppa Codes from Elementary Abelian p-Extensions of

Neuer Inhalt

    Bildnachweise