Results 41 to 50 of about 8,236,191 (249)
The total graph of a module [PDF]
, 2011 A generalization of the total graph of a ring is presented. Various properties are proved and some relations to the total graph of a ring as well as to the zero-divisor graph are ...
Pucanović, Zoran
core +5 more sources
Exact Formula and Improved Bounds for General Sum-Connectivity Index of Graph-Operations
IEEE Access, 2019 For a molecular graph Γ, the general sum-connectivity index is defined as χβ(Γ) = Σvw∈E(Γ)[dΓ(v) + dΓ(w)]β, where β ∈ R and dΓ(v) denotes the degree of the vertex ...
Maqsood Ahmad +3 more
doaj +1 more source
Jambura Journal of Mathematics, 2022 Let G = (V(G), E(G)) be a connected graph, where V(G) is the set of vertices and E(G) is the set of edges. The set Dt(G) is called the total domination set in G if every vertex v 2 V(G) is adjacent to at least one vertex in Dt (G).
Nurhamzah Nurhamzah +2 more
doaj +1 more source
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
Genus of total graphs from rings: A survey
AKCE International Journal of Graphs and Combinatorics, 2018 Let be a commutative ring. The total graph of is the undirected graph with vertex set and two distinct vertices and are adjacent if is a zero divisor in In this paper, we present a survey of results on the genus of and three of its generalizations.
T. Tamizh Chelvam, T. Asir
doaj +1 more source
The sharp bounds on general sum-connectivity index of four operations on graphs
Journal of Inequalities and Applications, 2016 The general sum-connectivity index χ α ( G ) $\chi_{\alpha}(G)$ , for a (molecular) graph G, is defined as the sum of the weights ( d G ( a 1 ) + d G ( a 2 ) ) α $(d_{G}(a_{1})+d_{G}(a_{2}))^{\alpha}$ of all a 1 a 2 ∈ E ( G ) $a_{1}a_{2}\in E(G)$ , where
Shehnaz Akhter, Muhammad Imran
doaj +1 more source
Biophysical approaches for studying viral entry
FEBS Letters, EarlyView.Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley +1 more source
TOTAL COLORING OF CENTRAL GRAPH OF STAR GRAPH [PDF]
, 2019 Total coloring of a graph given color the vertices and edge of a graph in such a way that no two adjacent vertices are assigned with the same color, no two adjacent edges are assigned with the same color and no edge and vertices are assigned with the ...
MUSPIRATUN, HENI
core +1 more source
Steiner radial number resulting from various graph operations
Electronic Journal of Graph Theory and ApplicationsThe Steiner n-radial graph of a graph G on p vertices, denoted by SRn(G), has the vertex set as in G and any n(2 ≤ n ≤ p) vertices are mutually adjacent in SRn(G) if and only if they are n-radial in G.
R. Gurusamy +3 more
doaj +1 more source
Computing Metric Dimension of Power of Total Graph
IEEE Access, 2021 For a connected graph $\mathcal {G}$ , the distance $d(u, v)$ between any two vertices $u$ , $v~\in ~\mathcal {V(G)}$ is defined as; $d(u,v)=\min _{\mathcal {P}_{u,v}}\{\text {length of}~\mathcal {P}_{uv}\}$ i.e the minimum length of path ...
Sehar Nawaz +3 more
doaj +1 more source