Results 41 to 50 of about 912,801 (279)

Recognition of prime graphs from a prime subgraph

open access: yesDiscrete Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierre Ille, Roger Villemaire
openaire   +4 more sources

Extending Undirected Graph Techniques to Directed Graphs via Category Theory

open access: yesMathematics
We use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra   +4 more
doaj   +1 more source

The Metric Dimension and Local Metric Dimension of Relative Prime Graph

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2020
This study aims to determine the value of metric dimensions and local metric dimensions of relative prime graphs formed from modulo  integer rings, namely . As a vertex set is  and  if  and  are relatively prime.
Inna Kuswandari   +2 more
doaj   +1 more source

Exhaustive Enumeration of Spatial Prime Structures

open access: yesMachines
Prime structures are link chains with 0 DoF (degrees of freedom), not including subchains with 0 or fewer DoF, which are expected to be used in systematic kinematic and dynamic analyses of link mechanisms.
Takahiro Aruga, Nobuyuki Iwatsuki
doaj   +1 more source

Relatively Prime Detour Domination Number of Switching Certain Special Graphs

open access: yesمجلة بغداد للعلوم
A set S ⊆ V is said to be a relatively prime detour dominating set of a graph G if it has at least two members is a detour set and a dominating set for any pair of vertices b and w such that (deg(b), deg(w)) = 1.
C. Jayasekaran, L. G. Binoja
doaj   +1 more source

Triangle-free graphs which are minimal for some nonstable 4-vertex subset

open access: yesArab Journal of Mathematical Sciences, 2015
In a graph G, a module is a vertex subset M such that every vertex outside M is adjacent to all or none of M. A graph G is prime if ϕ, the single-vertex sets, and V(G) are the only modules in G.
Mohammad Alzohairi
doaj   +1 more source

Prime vertex-minors of a prime graph

open access: yesEuropean Journal of Combinatorics
33 pages, 11 figures.
Donggyu Kim, Sang-il Oum
openaire   +3 more sources

Partial depletion of plasminogen activator inhibitor‐1 decreases subcutaneous fat cell hypertrophy and liver cholesterol in high‐fat‐fed female mice

open access: yesFEBS Letters, EarlyView.
Obesity raises blood levels of PAI‐1, a protein linked to metabolic dysfunction‐associated steatotic liver disease in people with obesity. In female mice fed a high‐fat diet, partially lowering PAI‐1 led to smaller subcutaneous fat cells and lower liver cholesterol, without changing body weight or insulin sensitivity.
Claudia E. Ramirez Bustamante   +10 more
wiley   +1 more source

Supermagic Coverings of Some Simple Graphs [PDF]

open access: yes, 2011
Showing that edge amalgamation of a finite collection of graphs isomorphic to any 2-connected simple graph H is H ...
Selvagopal, P., Jeyanthi, P.
core   +1 more source

Prime and Odd Prime Labelings on Cycle-Related Graphs

open access: yesScience and Technology Indonesia
Graph labeling is the process of determining integer values for vertices, edges, or both, based on certain criteria. Let G be a simple graph with the finite vertex set V(G). Prime labeling of G is a bijection ⍺:V(G)→{1,2,…,|V(G)|} for which each pair of
Hafif Komarullah   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy