Results 51 to 60 of about 258,952 (290)

Graph of pressure versus time (middle empty) from simulation data. [PDF]

, 2016
Graph of pressure versus time (middle empty) from simulation data.
Z. L. Gan (3148722), M. Z. Abdullah (3148716), Aizat Abas (3148725), Soon Fuat Khor (3148728), M. H. H. Ishak (3148719)   +4 more
core   +1 more source

Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs

Discrete Mathematics, 1984
Let G be a simple finite and connected graph with the vertex set V(G) and the edge set X(G). Let V'(G) be the family of all one-point subsets of V(G). Both the line graph L(G) of G and the total graph T(G) of G are standard graph theoretical concepts. The middle graph M(G) of G is the intersection graph of \(V'(G)\cup X(G)\) and the quasi-total graph P(
D. V. S. Sastry, B. Syam Prasad Raju
openaire   +2 more sources

On the rainbow connection numbers of line, middle, and total graphs of wheels

Electronic Journal of Graph Theory and Applications
An edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow ...
Lyra Yulianti, Muhardiansyah Muhardiansyah, Admi Nazra   +2 more
doaj   +1 more source

Computation of Vertex-Based Topological Indices of Middle Graph of Alkane CtH2t+2

Journal of Mathematics, 2022
Alkanes are the primary constituents of methane or natural gas that can also be found in volcanic crust. As a result of methane as a heat source, humans may cook without using any fuel in a volcanic environment.
Muhammad Shoaib Sardar, Imran Siddique, Fahd Jarad, Muhammad Asad Ali, Erkan Murat Türkan, Muhammad Danish   +5 more
doaj   +1 more source

Properties of Hereditary Hypergraphs and Middle Graphs [PDF]

Canadian Mathematical Bulletin, 1978
AbstractThe middle graph of a graph G=( V, E) is the graph M(G) = (V∪E, E′), in which two vertices u, v are adjacent if either M is a vertex in V and v is an edge in E containing u, or u and v are edges in E having a vertex in common. Middle graphs have been characterized in terms of line graphs by Hamada and Yoshimura [7], who also investigated their ...
Cockayne, E. J., Hedetniemi, S. T., Miller, D. J.   +2 more
openaire   +1 more source

Sigma chromatic number of the middle graph of some general families of trees of height 2 [PDF]

, 2023
Let G be a nontrivial connected graph and letc: V (G) → be a vertex coloring ofG, where adjacent vertices may have the same color. For a vertexv ofG, the color sumσ(v) ofv is the sum of the colors of the vertices adjacent tov. The coloringc is said to be
Manamtam, Jay R.A., Agnes D. Garciano, Jay-R. A. Manamtam, Tolentino, Mark Anthony C., Mark Anthony C. Tolentino, Garciano, Agnes D.   +5 more
core   +1 more source

Modeling the technological process of whelled harvester by applying Graph theory [PDF]

E3S Web of Conferences
The article presents typical schemes of the development of the harvest area and the technological operations performed by a middle-class feller-delimber-buncher (FDB) (Ponsse Ergo 8W) in the middle taiga of the Komi Republic under natural and production ...
Svoikin F.V., Svoikin V.F., Borozna A.A., Bozhbov V.E., Taraban M.V., Ryapukhin A.V.   +5 more
doaj   +1 more source

Sustained Therapeutic Efficacy of Intravenous Plasminogen Concentrate in Pediatric Patients With Type 1 Plasminogen Deficiency: An Analysis of Dosing Parameters and Clinical Outcomes

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, Karen Thibaudeau, Mary Mathias, Heather McDaniel, Madlen Reschke, Klaus Tenbrock, Joseph M. Parker, Amy Shapiro   +7 more
wiley   +1 more source

Modular irregularity strength of disjoint union of cycle-related graph [PDF]

ITM Web of Conferences
Let G = (V,E) be a graph with a vertex set V and an edge set E of G, with order n. Modular irregular labeling of a graph G is an edge k-labeling φ:E → {1, 2,…,k} such that the modular weight of all vertices is all different. The modular weight is defined
Barack Zeveliano Zidane, Sugeng Kiki Ariyanti   +1 more
doaj   +1 more source

Consensus Standards and Recommendations for Developmental and Cognitive Surveillance, Screening, and Evaluation in Sickle Cell Disease: Executive Summary From the National Alliance of Sickle Cell Centers Neurocognitive Workgroup

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Neurodevelopmental and neurocognitive difficulties are prevalent among individuals with sickle cell disease and warrant prompt identification and support. This Special Report provides an executive summary of standards and recommendations for surveillance, screening, and evaluation for development and cognition across the lifespan developed by ...
Alyssa M. Schlenz, Donna Murdaugh, Andrew M. Heitzer, Jennifer N. Longoria, Wendy Santos‐Modesitt, Arianna Martin, Judy Cavazos, Jeff Schatz, Catherine R. Hoyt, Alison King, Eboni I. Lance, Steven Hardy, Marsha Treadwell   +12 more
wiley   +1 more source