Results 21 to 30 of about 65 (64)
“#177 Article” Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In Cancer's Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32825.24163).
Henry Garrett
core +1 more source
“#164 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121).
Henry Garrett
core +1 more source
Additive List Coloring of Planar Graphs with Given Girth
An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors.
Brandt Axel +2 more
doaj +1 more source
“142nd Article” || Featured Tweets Available at @WordPress @Preprints_org @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter @LinkedIn @Amazon @googlebooks @GooglePlay — “#142nd Article” || New Research On Cancer's Recognition and Neutrosophic ...
Henry Garrett
core +1 more source
\begin{flushleft} {\Large \textbf\newline{ Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer's Recognition Titled (Neutrosophic) SuperHyperGraphs } } \newline % authors go here: Henry Garrett \\ \bigskip DrHenryGarrett@
Henry Garrett
core +1 more source
“155th Article” || Featured Tweets Available at @WordPress @Preprints_org @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter @LinkedIn @Amazon @googlebooks @GooglePlay — “#155th Article” || New Ideas In Cancer's Recognition And Neutrosophic ...
Henry Garrett
core +1 more source
“#199 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31025.45925). @ResearchGate: https://www.researchgate.net/
Henry Garrett
core +1 more source
A note on the eigenvalue free intervals of some classes of signed threshold graphs
We consider a particular class of signed threshold graphs and their eigenvalues. If Ġ is such a threshold graph and Q(Ġ ) is a quotient matrix that arises from the equitable partition of Ġ , then we use a sequence of elementary matrix operations to prove
Anđelić Milica +2 more
doaj +1 more source
“#183 Article” Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Cancer's Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30983.68009).
Henry Garrett
core +1 more source
Signed Complete Graphs with Maximum Index
Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges.
Akbari Saieed +3 more
doaj +1 more source

