Results 41 to 50 of about 507,111 (281)
On H-irregularity strengths of G-amalgamation of graphs
Electronic Journal of Graph Theory and Applications, 2017 A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subgraph of G isomorphic to a given graph H. Then the graph G admitting H-covering admits an H-irregular total k-labeling f: V(G) U E(G) \to {1, 2, ..., k} if
Faraha Ashraf +3 more
doaj +1 more source
ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS [PDF]
Journal of Algebraic Systems, 2015 Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set.
Saeid Alikhani, Sommayeh Jahari
doaj +1 more source
Connectedness of graphs and its application to connected matroids through covering-based rough sets [PDF]
, 2015 Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree.
Huang, Aiping, Zhu, William
core
Covering a cubic graph with perfect matchings
, 2013 Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them.
Mazzuoccolo, Giuseppe
core +1 more source
Domination cover number of graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2019 A set [Formula: see text] for the graph [Formula: see text] is called a dominating set if any vertex [Formula: see text] has at least one neighbor in [Formula: see text]. Fomin et al. [Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications, ACM Transactions on Algorithms (TALG) 5(1) (2008) 9] gave an algorithm ...
M. Alambardar Meybodi +3 more
openaire +2 more sources
Aggressive prostate cancer is associated with pericyte dysfunction
Molecular Oncology, EarlyView.Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source
The monadic second-order logic of graphs XVI : Canonical graph decompositions [PDF]
Logical Methods in Computer Science, 2006 This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like the modular ...
Bruno Courcelle
doaj +1 more source
Covering problems in edge- and node-weighted graphs
, 2014 This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large integrality gap of a
A. Berger +18 more
core +1 more source
Journal of Algebra, 2005 k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a satisfactory version of the usual topological classification in terms of subgroups of a fundamental group.
Pask, David, Quigg, J., Raeburn, Iain
openaire +3 more sources
Molecular Oncology, EarlyView.We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck +12 more
wiley +1 more source