Results 51 to 60 of about 732,396 (308)
Isolation Number of Transition Graphs
MathematicsLet G=(V,E) be a graph and F be a family of graphs; a subset (S⊆V(G)) is said to be an F-isolating set if G[V(G)∖NG[S]] does not contain F as a subgraph for all F∈F.
Junhao Qu, Shumin Zhang
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
Smarandache Directionally n-Signed Graphs — A Survey [PDF]
, 2013 For graph theory terminology and notation in this paper we follow the book [3]. All graphs considered here are finite and simple.
P. Siva Kota Reddy, Reddy, P.Siva Kota
core +1 more source
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
Discrete Mathematics, 2002 A one-to-one mapping \(V\cup E \rightarrow \{1, 2, \ldots, |V|+|E|\}\) is vertex magic, if each vertex has the same sum of its label and the labels of its incident edges, and is edge magic if each edge has the same sum of its label and the labels of its endpoints.
Exoo, Geoffrey +4 more
openaire +1 more source
On the total forcing number of a graph [PDF]
Discrete Applied Mathematics, 2019 Let $G$ be a simple and finite graph without isolated vertices. In this paper we study forcing sets (zero forcing sets) which induce a subgraph of $G$ without isolated vertices. Such a set is called a total forcing set, introduced and first studied by Davila \cite{Davila}.
Randy Davila, Michael A. Henning
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Type 1 plasminogen deficiency (PLGD‐1) is an ultra‐rare autosomal recessive disorder caused by variants in the PLG gene and affects approximately 1.6 individuals per million. The condition is characterized by decreased plasminogen levels and impaired function, resulting in fibrin‐rich lesions on mucous membranes throughout the body.
Charles Nakar +7 more
wiley +1 more source
BILANGAN DOMINASI TOTAL PADA TRIANGULAR SNAKE GRAPH [PDF]
, 2020 Graf dengan adalah himpunan titik dan adalah himpunan sisi yang menghubungkan sepasang titik. Himpunan , disebut himpunan dominasi pada graf jika semua titik yang tidak berada pada himpunan bertetangga sedikitnya dengan satu titik dari dan
Kiftiah, Mariatul +2 more
core +2 more sources
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