Results 1 to 10 of about 445 (76)

The nervous supply to the nasal cavity of the Bactrian camel (Camelus bactrianus). [PDF]

Vet Res Commun, 2004
Cui S, Wang JH, Xie ZM.
europepmc   +1 more source

Fuzzy and crisp computational analysis of certain graphs structures via machine learning techniques. [PDF]

Sci Rep
Mufti ZS, AlQadi H, Tabraiz A, Hanif MF, Fiidow MA.   +4 more
europepmc   +1 more source

A QSPR analysis of physical properties of antituberculosis drugs using neighbourhood degree-based topological indices and support vector regression. [PDF]

Heliyon
Abubakar MS, Aremu KO, Aphane M, Amusa LB.   +3 more
europepmc   +1 more source

Antimicrobial activity of cell-free supernatant of lactic acid bacteria on spoilage bacteria of vacuum-packed sliced emulsion-type sausages. [PDF]

Iran J Vet Res
Tajbakhsh S, Eskandari MH, Shekarforoush SS.   +2 more
europepmc   +1 more source

Upward-closed hereditary families in the dominance order [PDF]

Discrete Mathematics & Theoretical Computer Science, 2022
The majorization relation orders the degree sequences of simple graphs into posets called dominance orders. As shown by Ruch and Gutman (1979) and Merris (2002), the degree sequences of threshold and split graphs form upward-closed sets within the ...
Michael D. Barrus, Jean A. Guillaume
doaj   +1 more source

Conflict-Free Vertex Connection Number At Most 3 and Size of Graphs

Discussiones Mathematicae Graph Theory, 2021
A path in a vertex-coloured graph is called conflict-free if there is a colour used on exactly one of its vertices. A vertex-coloured graph is said to be conflict-free vertex-connected if any two distinct vertices of the graph are connected by a conflict-
Doan Trung Duy, Schiermeyer Ingo
doaj   +1 more source

Spectra of Orders for k-Regular Graphs of Girth g

Discussiones Mathematicae Graph Theory, 2021
A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n ...
Jajcay Robert, Raiman Tom
doaj   +1 more source

An extremal problem on potentially K_p,1,1-graphic sequences [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
A sequence S is potentially K_p,1,1 graphical if it has a realization containing a K_p,1,1 as a subgraph, where K_p,1,1 is a complete 3-partite graph with partition sizes p,1,1.
Chunhui Lai
doaj   +1 more source