Cargando…
Algorithmic approach to find [Formula: see text]-consistency in Common-Edge signed graph
Common-Edge signed graph [Formula: see text] of a signed graph [Formula: see text] is a signed graph whose vertex-set is the pairs of adjacent edges in [Formula: see text] and two vertices are adjacent if the corresponding pairs of adjacent edges of [Formula: see text] have exactly one edge in commo...
Autores principales: | Sethi, Anshu, Sinha, Deepa, Wardak, Obaidullah |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9356266/ https://www.ncbi.nlm.nih.gov/pubmed/35942208 http://dx.doi.org/10.1016/j.mex.2022.101783 |
Ejemplares similares
-
Subdivision of graphs in [Formula: see text]
por: Wijaya, Kristiana, et al.
Publicado: (2020) -
Mycielski Graphs and [Formula: see text] Proofs
por: Yolcu, Emre, et al.
Publicado: (2020) -
Which graphs are rigid in [Formula: see text] ?
por: Dewar, Sean, et al.
Publicado: (2021) -
Observation of B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] and B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] decays
por: Tumasyan, A., et al.
Publicado: (2022) -
[Formula: see text] rule, [Formula: see text] and [Formula: see text] in [Formula: see text] and [Formula: see text] models with FCNC quark couplings
por: Buras, Andrzej J., et al.
Publicado: (2014)