Search

Your search keyword '"WEI GAO"' showing total 3 results
3 results on '"WEI GAO"'

1. Sun Toughness Conditions for <math xmlns='http://www.w3.org/1998/Math/MathML' id='M1'> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </math> and <math xmlns='http://www.w3.org/1998/Math/MathML' id='M2'> <msub> <mrow> <mi>P</mi> </mrow> <mrow> <mn>3</mn> </mrow> </msub> </math> Factor Uniform and Factor Critical Avoidable Graphs

Author

Shu Gong, Wei Gao, and Haci Mehmet Baskonus

Subjects
Discrete mathematics, Toughness, Basis (linear algebra), General Mathematics, Factor (programming language), Component (UML), Perspective (graphical), Structure (category theory), Graph theory, computer, Graph, computer.programming_language, Mathematics
Abstract

The security of a network is closely related to the structure of the network graph. The denser the network graph structure is, the better it can resist attacks. Toughness and isolated toughness are used to characterize the vulnerable programs of the network which have been paid attention from mathematics and computer scholars. On this basis, considering the particularity of the sun component structures, sun toughness was introduced in mathematics and applied to computer networks. From the perspective of modern graph theory, this paper presents the sun toughness conditions of the path factor uniform graph and the path factor critical avoidable graph in P ≥ 2 -factor and P ≥ 3 -factor settings. Furthermore, examples show that the given boundaries are sharp.

Published
2021

2. Remarks on path-factor critical avoidable graphs.

Author

Zhengyue He, Li Liang, Baskonus, Haci Mehmet, and Wei Gao

Subjects
GRAPH theory, MATHEMATICAL bounds, PARAMETER estimation, MATHEMATICAL models, MATHEMATICAL formulas
Abstract

Zhou (2023) introduced the concept of path-factor critical avoidable graph and determined several parameter bounds for (P>2, η) or (P>3, η)-factor critical avoidable graphs. Certain instances are listed in Zhou (2023) to show that these toughness or isolated toughness bounds are sharp. However, the derivation processes are flawed. In this remark, we directly modify the derivation processes and obtain the revised bounds. The counterexamples are updated to satisfy K(G) = η + 2. Finally, richness bounds on binding number for a graph to be path-factor critical avoidable are determined. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

3. Bipolar Fuzzy Influence Graph and Its Chemical Application.

Author

Juanjuan Lu, Linli Zhu, and Wei Gao

Subjects
*FUZZY graphs, *MEMBERSHIP functions (Fuzzy logic), *MOLECULAR graphs, *GRAPH theory, *PHYSICAL & theoretical chemistry, *MOLECULAR structure, *CHEMICAL structure
Abstract

As a critical field of theoretical chemistry, chemical graph theory works as a key part in the model topology calculation and prediction based on chemical molecular structures. The paper can contribute to the research in the following aspects: (1) We propose the concept of bipolar fuzzy influence graph, using positive and negative membership functions to describe positive and negative uncertainties respectively; (2) Based on the new concept, we give a hypothesis to explain the memory of water. The hypothesis is based on two salient facts of the bipolar fuzzy influence graph. Initially, the non-collapsibility of the positive and negative membership functions ensures that the information after using fuzzy coding will not change with the material layer. Then, the influence pairs connect the vertices and edges between different components in the graph through bipolar uncertain influence. At the end of this paper, the conditions for the establishment of the hypothesis and the facts to be verified in the future are analyzed. [ABSTRACT FROM AUTHOR]

Published
2023

Catalog

Books, media, physical & digital resources
See catalog results