Results 251 to 260 of about 972,352 (283)

ON CHARACTERIZATIONS OF THE MIDDLE GRAPHS

ON CHARACTERIZATIONS OF THE MIDDLE GRAPHS
openaire  

Some of the next articles are maybe not open access.

Related searches:

DOUBLE ROMAN DOMINATION NUMBER OF MIDDLE GRAPH

South East Asian J. of Mathematics and Mathematical Sciences, 2022
For any graph G(V,  E), a function f : V (G)    0, 1, 2, 3     is called Double Roman dominating function (DRDF) if the following properties holds, If f (v) = 0, then there exist two vertices v1, v2 ∈ N (v) for which f (v1) = f (v2) = 2 or there exist one vertex u ∈ N (v) for which f (u) = 3.∈ If f (v) = 1, then there exist one vertex u N (v) for which
Shirkol, Shailaja S., Kumbargoudra, Pavitra P., Kaliwal, Meenal M.   +2 more
openaire   +2 more sources

Domination-related parameters in middle graphs

Discrete Mathematics, Algorithms and Applications, 2023
The middle graph [Formula: see text] of a graph [Formula: see text] is the graph obtained by subdividing each edge of [Formula: see text] exactly once and joining all these newly introduced vertices of adjacent edges of [Formula: see text]. It is known that the decision problems for Italian domination number [Formula: see text], [Formula: see text ...
openaire   +2 more sources

RUPTURE DEGREE AND MIDDLE GRAPHS

2012
WOS ...
Odabaş Z.N., Aytaç A.
openaire   +3 more sources

On the nullity of middle graphs

Linear Algebra and its Applications
The nullity of a graph is the multiplicity of \(0\) as an eigenvalue of its adjacency matrix. Classifying connected graphs with a given nullity is a difficult problem. \textit{I. Gutman} and \textit{I. Sciriha} [Discrete Math. 232, No. 1--3, 35--45 (2001; Zbl 0971.05070)] showed that, although the nullity of connected line graphs is unbounded, the case
Xinmei Yuan, Danyi Li, Weigen Yan
openaire   +1 more source

On the edge-tenacity of the middle graph of a graph

International Journal of Computer Mathematics, 2005
We consider the problem of efficiently breaking a graph into small components by removing edges. One measure of how easily this can be done is the edge-tenacity. Given a set of edges of G, the score of S is defined as sc(S)=[| S|+τ (G−S)]/[w(G−S)]. Formally, the edge-tenacity of a graph G is defined as T′(G)=min sc(S), where the minimum is taken over ...
openaire   +2 more sources

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce, Lorenzo Cohen, Karen M Mustian   +2 more
exaly  

Middle School Mathematics Teachers' Graph Teaching: From a Graph Literacy Perspective

Teaching Statistics
AbstractGraph literacy is becoming increasingly important as data are frequently presented in graphical form. However, there is limited research on the types of graph problems teachers use, particularly in Turkish classrooms. This study aimed to evaluate the types of graph‐related problems employed by six Grade 7 teachers in two schools in Turkiye ...
Sefa Uyanik, Zeynep Medine Özmen
openaire   +1 more source

Climate Change and Weather Extremes in the Eastern Mediterranean and Middle East

Reviews of Geophysics, 2022
George Zittis, Mansur Mansur, Pinhas Alpert   +2 more
exaly  

Mortality from gastrointestinal congenital anomalies at 264 hospitals in 74 low-income, middle-income, and high-income countries: a multicentre, international, prospective cohort study

Lancet, The, 2021
Naomi Jane Wright, Nick Sevdalis, Justine I Davies   +2 more
exaly