13 results for "Shixun Lin"
Showing 1–13 · 0.53 seconds · RSS
-
Journal Article Full text
Classifying cubic symmetric graphs of order 52p2; pp. 55–60
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. In this paper, we classify all connected cubic symmetric graphs of order 52p2 for each prime p.
-
Journal Article Full text
New fixed points of mixed monotone operators with applications to nonlinear integral equations
In this paper, first we recall and present some basic results about cone and partial order within the framework of Banach spaces. Next, by means of the properties of cone and monotone iterative techniques, some new fixed point theorems of mixed monotone operators with certain concavity and…
-
Journal Article
Metric and strong metric dimension in TI-power graphs of finite groups
Given a finite group $ G $ with the identity $ e $, the TI-power graph (trivial intersection power graph) of $ G $ is an undirected graph with vertex set $ G $, in which two distinct vertices $ x $ and $ y $ are adjacent if $ \langle x\rangle\cap \langle y\rangle = \{e\} $. In this paper, we obtain…
-
Journal Article Full text
Finite groups whose order graph is C4-free
Given a finite group G , the order graph of G, denoted by S(G), is a graph whose vertex set is G, and two distinct vertices a and b are adjacent if o(a) | o(b) or o(b) | o(a), where o(a), and o(b), are the orders of a and b in G, respectively. In this paper, by the order of an element, we give a…
-
Journal Article Full text
Finite groups whose coprime graph is split, threshold, chordal, or a cograph
Given a finite group G, the coprime graph of G, denoted by Î(G), is defined as an undirected graph with the vertex set G, and for distinct x, y â G, x is adjacent to y if and only if (o(x), o(y)) = 1, where o(x) and o(y) are the orders of x and y, respectively. This paper classifies the finite…
-
Journal Article Full text
On connected components and perfect codes of proper order graphs of finite groups
Let G be a finite group with the identity element e. The proper order graph of G, denoted by â* (G), is an undirected graph with a vertex set G \ {e}, where two distinct vertices x and y are adjacent whenever o(x) | o(y) or o(y) | o(x), where o(x) and o(y) are the orders of x and y, respectively…
-
Journal Article
On forbidden subgraphs of main supergraphs of groups
In this study, we explore the main supergraph $ \mathcal{S}(G) $ of a finite group $ G $, defined as an undirected, simple graph with a vertex set $ G $ in which two distinct vertices, $ a $ and $ b $, are adjacent in $ \mathcal{S}(G) $ if the order of one is a divisor of the order of the other…
-
Journal Article
The microenvironment in the development of MASLD-MASH-HCC and associated therapeutic in MASH-HCC
Metabolic dysfunction-associated steatotic liver disease (MASLD) is a series of obesity-related metabolic liver diseases, ranging from relatively benign hepatic steatosis to metabolic-associated steatohepatitis (MASH). With the changes in lifestyle, its incidence and prevalence have risen to…
-
Journal Article
Identification and clinical validation of EMT-associated prognostic features based on hepatocellular carcinoma
Abstract Background The aim of this study was to construct a model based on the prognostic features associated with epithelial–mesenchymal transition (EMT) to explore the various mechanisms and therapeutic strategies available for the treatment of metastasis and invasion by hepatocellular carcinoma…
-
Journal Article
ECT2 overexpression promotes the polarization of tumor-associated macrophages in hepatocellular carcinoma via the ECT2/PLK1/PTEN pathway
Abstract Hepatocellular carcinoma (HCC) is a common high-mortality cancer, mainly due to diagnostic difficulties during its early clinical stages. In this study, we aimed to identify genes that are important for HCC diagnosis and treatment, and we investigated the underlying mechanism of prognostic…