Search results: Found 3

Listing 1 - 3 of 3
Sort by
Graph-Theoretic Problems and Their New Applications

Author:
ISBN: 9783039287987 / 9783039287994 Year: Pages: 294 DOI: 10.3390/books978-3-03928-799-4 Language: eng
Publisher: MDPI - Multidisciplinary Digital Publishing Institute
Subject: Science (General) --- Mathematics
Added to DOAB on : 2020-06-09 16:38:57
License:

Loading...
Export citation

Choose an application

Abstract

Graph theory is an important area of applied mathematics with a broad spectrum of applications in many fields. This book results from aSpecialIssue in the journal Mathematics entitled “Graph-Theoretic Problems and Their New Applications”. It contains 20 articles covering a broad spectrum of graph-theoretic works that were selected from 151 submitted papers after a thorough refereeing process. Among others, it includes a deep survey on mixed graphs and their use for solutions ti scheduling problems. Other subjects include topological indices, domination numbers of graphs, domination games, contraction mappings, and neutrosophic graphs. Several applications of graph theory are discussed, e.g., the use of graph theory in the context of molecular processes.

Keywords

graph coloring --- Kempe chain --- Kempe-locking --- Birkhoff diamond --- hypergraph --- generalized hypertree --- bound --- component --- adjacent matrix --- signless Laplacian --- spectral radius --- connectivity --- interval-valued fuzzy graph --- intuitionistic fuzzy graph --- interval-valued intuitionistic fuzzy graph --- single-valued neutrosophic graph --- interval-valued neutrosophic graph --- complement --- k-rainbow dominating function --- k-rainbow domination number --- grids --- domination number --- Cartesian product --- directed cycle --- DD index --- Wiener index --- Edge Wiener --- degree of a vertex --- distance between two vertices --- normalized Laplacian --- resistance distance --- degree-Kirchhoff index --- spanning tree --- extremal values --- PI index --- k-trees --- distance --- Zagreb indices --- reformulated Zagreb indices --- degree of vertex --- degree of edge --- embedding --- edge congestion --- wirelength --- enhanced hypercube --- subtree --- generating function --- fan graph --- wheel graph --- “partitions” of wheel graph --- neutrosophic graph --- complete neutrosophic graph --- bipartite neutrosophic graph --- complement neutrosophic graph --- road transport network --- wireless multihop network and social network --- perfect matching --- k-extendable --- induced matching extendable --- bipartite matching extendable graph --- evolution theory --- evolution algebra --- mitotic cell cycle --- total-colored graph --- inverse degree index --- generalized first Zagreb index --- sum lordeg index --- corona product --- join of graphs --- line graph --- Mycielskian graph --- polynomials in graphs --- b-metric space --- b-metric-like space --- general contractive mappings --- graphic contraction mappings --- approximation methods --- chromatic number --- combinatorial optimization --- complexity analysis --- evolutionary approach --- genetic algorithm --- graph coloring --- NP-hard --- stochastic convergence --- domination game --- competition-independence game --- mixed graph --- vertex coloring --- chromatic number --- edge coloring --- chromatic index --- chromatic polynomial --- unit-time scheduling --- makespan criterion --- n/a

Molecular Computing and Bioinformatics

Authors: --- ---
ISBN: 9783039211951 9783039211968 Year: Pages: 390 DOI: 10.3390/books978-3-03921-196-8 Language: English
Publisher: MDPI - Multidisciplinary Digital Publishing Institute
Subject: Technology (General) --- Biotechnology
Added to DOAB on : 2019-08-28 11:21:27
License:

Loading...
Export citation

Choose an application

Abstract

This text will provide the most recent knowledge and advances in the area of molecular computing and bioinformatics. Molecular computing and bioinformatics have a close relationship, paying attention to the same object but working towards different orientations. The articles will range from topics such as DNA computing and membrane computing to specific biomedical applications, including drug R&D and disease analysis.

Keywords

prostate cancer --- Mycoplasma hominis --- endoplasmic reticulum --- systems biology --- protein targeting --- biomedical text mining --- big data --- Tianhe-2 --- parallel computing --- load balancing --- bacterial computing --- bacteria and plasmid system --- Turing universality --- recursively enumerable function --- miRNA biogenesis --- structural patterns --- DCL1 --- protein–protein interaction (PPI) --- clustering --- protein complex --- penalized matrix decomposition --- avian influenza virus --- interspecies transmission --- amino acid mutation --- machine learning --- Bayesian causal model --- causal direction learning --- K2 --- brain storm optimization --- line graph --- Cartesian product graph --- join graph --- atom-bond connectivity index --- geometric arithmetic index --- P-glycoprotein --- efflux ratio --- in silico --- machine learning --- hierarchical support vector regression --- absorption --- distribution --- metabolism --- excretion --- toxicity --- image encryption --- chaotic map --- DNA coding --- Hamming distance --- Stenotrophomonas maltophilia --- iron acquisition systems --- iron-depleted --- RAST server --- NanoString Technologies --- siderophores --- gene fusion data --- gene susceptibility prioritization --- evaluating driver partner --- gene networks --- drug-target interaction prediction --- machine learning --- drug discovery --- microRNA --- environmental factor --- structure information --- similarity network --- bioinformatics --- identification of Chinese herbal medicines --- biochip technology --- DNA barcoding technology --- DNA strand displacement --- cascade --- 8-bit adder/subtractor --- domain label --- Alzheimer’s disease --- gene coding protein --- sequence information --- support vector machine --- classification --- adverse drug reaction prediction --- heterogeneous information network embedding --- stacking denoising auto-encoder --- meta-path-based proximity --- Panax ginseng --- oligopeptide transporter --- flowering plant --- phylogeny --- transcription factor --- multiple interaction networks --- function prediction --- multinetwork integration --- low-dimensional representation --- dihydrouridine --- nucleotide physicochemical property --- pseudo dinucleotide composition --- RNA secondary structure --- ensemble classifier --- diabetes mellitus --- hypoxia-inducible factor-1? --- angiogenesis --- bone formation --- osteogenesis --- protein transduction domain --- membrane computing --- edge detection --- enzymatic numerical P system --- resolution free --- molecular computing --- molecular learning --- DNA computing --- self-organizing systems --- pattern classification --- machine learning --- laccase --- Brassica napus --- lignification --- stress --- molecular computing --- bioinformatics --- machine learning --- protein --- DNA --- RNA --- drug --- bio-inspired

Discrete Mathematics and Symmetry

Author:
ISBN: 9783039281909 9783039281916 Year: Pages: 458 DOI: 10.3390/books978-3-03928-191-6 Language: English
Publisher: MDPI - Multidisciplinary Digital Publishing Institute
Subject: Science (General) --- Mathematics
Added to DOAB on : 2020-04-07 23:07:08
License:

Loading...
Export citation

Choose an application

Abstract

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group.

Keywords

strongly regular graph --- automorphism group --- orbit matrix --- binary polyhedral group --- icosahedron --- dodecahedron --- 600-cell --- Electric multiple unit trains --- high-level maintenance planning --- time window --- 0–1 programming model --- particle swarm algorithm --- fixed point --- split-quaternion --- quadratic polynomial --- split-octonion --- neutrosophic set --- neutrosophic rough set --- pessimistic (optimistic) multigranulation neutrosophic approximation operators --- complete lattice --- rough set --- matroid --- operator --- attribute reduction --- graded rough sets --- rough intuitionistic fuzzy sets --- dominance relation --- logical conjunction operation --- logical disjunction operation --- multi-granulation --- planar point set --- convex polygon --- disjoint holes --- fuzzy logic --- pseudo-BCI algebra --- quasi-maximal element --- KG-union --- quasi-alternating BCK-algebra --- quality function deployment --- engineering characteristics --- group decision making --- 2-tuple --- metro station --- emergency routes --- graph partitioning --- graph clustering --- invariant measures --- partition comparison --- finite automorphism groups --- graph automorphisms --- Fuzzy sets --- ring --- normed space --- fuzzy normed ring --- fuzzy normed ideal --- fuzzy implication --- quantum B-algebra --- q-filter --- quotient algebra --- basic implication algebra --- Detour–Harary index --- maximum --- unicyclic --- bicyclic --- cacti --- three-way decisions --- intuitionistic fuzzy sets --- multi-granulation rough intuitionistic fuzzy sets --- granularity importance degree --- complexity --- Chebyshev polynomials --- gear graph --- pyramid graphs --- edge detection --- Laplacian operation --- regularization --- parameter selection --- performance evaluation --- aggregation operator --- triangular norm --- ?-convex set --- atom-bond connectivity index --- geometric arithmetic index --- line graph --- generalized bridge molecular graph --- graceful labeling --- edge graceful labeling --- edge even graceful labeling --- polar grid graph --- graph --- good drawing --- crossing number --- join product --- cyclic permutation --- nonlinear --- synchronized --- linear discrete --- chaotic system --- algorithm --- generalized permanental polynomial --- coefficient --- co-permanental --- isoperimetric number --- random graph --- intersection graph --- social network --- Abel–Grassmann’s groupoid (AG-groupoid) --- Abel–Grassmann’s group (AG-group) --- involution AG-group --- commutative group --- filter --- graceful labeling --- edge even graceful labeling --- cylinder grid graph --- selective maintenance --- multi-state system --- human reliability --- optimization --- genetic algorithm --- hypernear-ring --- multitransformation --- embedding --- distance matrix (spectrum) --- distance signlees Laplacian matrix (spectrum) --- (generalized) distance matrix --- spectral radius --- transmission regular graph --- graph --- good drawing --- crossing number --- join product --- cyclic permutation --- cyclic associative groupoid (CA-groupoid) --- cancellative --- variant CA-groupoids --- decomposition theorem --- construction methods

Listing 1 - 3 of 3
Sort by
Narrow your search

Publisher

MDPI - Multidisciplinary Digital Publishing Institute (3)


License

CC by-nc-nd (3)


Language

english (2)

eng (1)


Year
From To Submit

2020 (2)

2019 (1)