Готові списки джерел за темами / Associated graph

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Associated graph"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Associated graph".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Associated graph"

Chen, X. Y., A. R. Moghaddamfar, and M. Zohourattar. "Some properties of various graphs associated with finite groups." Algebra and Discrete Mathematics 31, no. 2 (2021): 195–211. http://dx.doi.org/10.12958/adm1197.

Повний текст джерела

Анотація:

In this paper we investigate some properties of the power graph and commuting graph associated with a finite group, using their tree-numbers. Among other things, it is shown that the simple group L2(7) can be characterized through the tree-number of its power graph. Moreover, the classification of groups with power-free decomposition is presented. Finally, we obtain an explicit formula concerning the tree-number of commuting graphs associated with the Suzuki simple groups.

Стилі APA, Harvard, Vancouver, ISO та ін.

Najmuddin, Nabilah, Nor Haniza Sarmin, and Ahmad Erfanian. "General Form of Domination Polynomial for Two Types of Graphs Associated to Dihedral Groups." MATEMATIKA 35, no. 2 (2019): 149–55. http://dx.doi.org/10.11113/matematika.v35.n2.1106.

Повний текст джерела

Анотація:

A domination polynomial is a type of graph polynomial in which its coefficients represent the number of dominating sets in the graph. There are many researches being done on the domination polynomial of some common types of graphs but not yet for graphs associated to finite groups. Two types of graphs associated to finite groups are the conjugate graph and the conjugacy class graph. A graph of a group G is called a conjugate graph if the vertices are non-central elements of G and two distinct vertices are adjacent if they are conjugate to each other. Meanwhile, a conjugacy class graph of a gro

Стилі APA, Harvard, Vancouver, ISO та ін.

Ansari, Moin, Azeem Haidar, and Ali Koam. "On a Graph Associated to UP-Algebras." Mathematical and Computational Applications 23, no. 4 (2018): 61. http://dx.doi.org/10.3390/mca23040061.

Повний текст джерела

Анотація:

In this article, we introduce the concept of graphs associated with commutative UP-algebra, which we say is a UP-graph whose vertices are the elements of commutative UP-algebra and whose edges are the association of two vertices, that is two elements from commutative UP-algebra. We also define a graph of equivalence classes of a commutative UP-algebra and prove some related results based on the algebraic properties of the graph. We show that two graphs are the same and complete bipartite if they are formed by equivalence classes of UP-algebra and the graph folding of commutative UP-algebra. An

Стилі APA, Harvard, Vancouver, ISO та ін.

Hashemi, Ebrahim, Mona Abdi, Abdollah Alhevaz, and Huadong Su. "Domination number of graphs associated with rings." Journal of Algebra and Its Applications 19, no. 01 (2019): 2050009. http://dx.doi.org/10.1142/s0219498820500097.

Повний текст джерела

Анотація:

The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. Let [Formula: see text] be an associative (not necessarily commutative) ring. We focus on the domination number of the zero-divisor graph [Formula: see text], the compressed zero-divisor graph [Formula: see text] and the unit graph [Formula: see text]. We find some relations between the domination number of the zero-divisor graph and that of the compressed zero-divisor graph. Moreover, some relations between the domination number of [Formula: s

Стилі APA, Harvard, Vancouver, ISO та ін.

Joardar, Soumalya, and Arnab Mandal. "Quantum symmetry of graph C∗-algebras associated with connected graphs." Infinite Dimensional Analysis, Quantum Probability and Related Topics 21, no. 03 (2018): 1850019. http://dx.doi.org/10.1142/s0219025718500194.

Повний текст джерела

Анотація:

We define a notion of quantum automorphism groups of graph [Formula: see text]-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of the underlying directed graph in the sense of Banica [Quantum automorphism groups of homogeneous graphs, J. Funct. Anal. 224 (2005) 243–280] (which is also the symmetry object in the sense of [S. Schmidt and M. Weber, Quantum symmetry of graph [Formula: see text]-algebras, arXiv:1706.08833 ] is shown to be a quantum subgroup of quantum automorphism group in

Стилі APA, Harvard, Vancouver, ISO та ін.

BARATI, Z., K. KHASHYARMANESH, F. MOHAMMADI, and KH NAFAR. "ON THE ASSOCIATED GRAPHS TO A COMMUTATIVE RING." Journal of Algebra and Its Applications 11, no. 02 (2012): 1250037. http://dx.doi.org/10.1142/s0219498811005610.

Повний текст джерела

Анотація:

Let R be a commutative ring with nonzero identity. For an arbitrary multiplicatively closed subset S of R, we associate a simple graph denoted by ΓS(R) with all elements of R as vertices, and two distinct vertices x, y ∈ R are adjacent if and only if x+y ∈ S. Two well-known graphs of this type are the total graph and the unit graph. In this paper, we study some basic properties of ΓS(R). Moreover, we will improve and generalize some results for the total and the unit graphs.

Стилі APA, Harvard, Vancouver, ISO та ін.

DeTemple, Duane, and Jack M. Robertson. "Graphs associated with triangulations of lattice polygons." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 47, no. 3 (1989): 391–98. http://dx.doi.org/10.1017/s1446788700033115.

Повний текст джерела

Анотація:

AbstractTwo graphs, the edge crossing graph E and the triangle graph T are associated with a simple lattice polygon. The maximal independent sets of vertices of E and T are derived including a formula for the size of the fundamental triangles. Properties of E and T are derived including a formula for the size of the maximal independent sets in E and T. It is shown that T is a factor graph of edge-disjoint 4-cycles, which gives corresponding geometric information, and is a partition graph as recently defined by the authors and F. Harary.

Стилі APA, Harvard, Vancouver, ISO та ін.

Varghese, Melvin, and G. Sheeja. "On the Cayley type graph construction and characterization associated with ternary semigroups." Journal of Discrete Mathematical Sciences and Cryptography 28, no. 1 (2025): 281–302. https://doi.org/10.47974/jdmsc-2231.

Повний текст джерела

Анотація:

Cayley graphs of binary semigroup was introduced by Bohdan Zelinka. We introduce two Cayley type graph construction from ternary semigroups. The graph of first kind h (T,B) is a oriented hypergraph and the graph of second kind ( , ) d  T B is a oriented multigraph for a semigroup T with ternary operation and a connection set B ⊆ T. We study subgraphs of these graphs and investigate some properties of these graphs. We give characterization theorems for graphs which are first kind and second kind for a ternary semigroup T.

Стилі APA, Harvard, Vancouver, ISO та ін.

Alashwali, Hanaa, and Anwar Saleh. "Common Neighborhood Energy of the Non-Commuting Graphs and Commuting Graphs Associated with Dihedral and Generalized Quaternion Groups." Mathematics 13, no. 11 (2025): 1834. https://doi.org/10.3390/math13111834.

Повний текст джерела

Анотація:

This paper explores the common neighborhood energy (ECN(Γ)) of graphs derived from the dihedral group D2n and generalized quaternion group Q4n, specifically the non-commuting graph (NCM-graph) and the commuting graph (CM-graph). Studying graphs associated with groups offers a powerful approach to translating algebraic properties into combinatorial structures, enabling the application of graph-theoretic tools to understand group behavior. The common neighborhood energy, defined as the sum of the absolute values of the eigenvalues of the common neighborhood (CN) matrix, i.e., ∑i=1p|ζi|, where {ζ

Стилі APA, Harvard, Vancouver, ISO та ін.

Hoppen, Carlos, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, and Henrique Stagni. "Estimating parameters associated with monotone properties." Combinatorics, Probability and Computing 29, no. 4 (2020): 616–32. http://dx.doi.org/10.1017/s0963548320000048.

Повний текст джерела

Анотація:

AbstractThere has been substantial interest in estimating the value of a graph parameter, i.e. of a real-valued function defined on the set of finite graphs, by querying a randomly sampled substructure whose size is independent of the size of the input. Graph parameters that may be successfully estimated in this way are said to be testable or estimable, and the sample complexity qz = qz(ε) of an estimable parameter z is the size of a random sample of a graph G required to ensure that the value of z(G) may be estimated within an error of ε with probability at least 2/3. In this paper, for any f

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Associated graph"

Meyer, Marie. "Polytopes Associated to Graph Laplacians." UKnowledge, 2018. https://uknowledge.uky.edu/math_etds/54.

Повний текст джерела

Анотація:

Graphs provide interesting ways to generate families of lattice polytopes. In particular, one can use matrices encoding the information of a finite graph to define vertices of a polytope. This dissertation initiates the study of the Laplacian simplex, PG, obtained from a finite graph G by taking the convex hull of the columns of the Laplacian matrix for G. The Laplacian simplex is extended through the use of a parallel construction with a finite digraph D to obtain the Laplacian polytope, PD. Basic properties of both families of simplices, PG and PD, are established using techniques from Ehrha

Стилі APA, Harvard, Vancouver, ISO та ін.

Reiß, Susanna. "Optimizing Extremal Eigenvalues of Weighted Graph Laplacians and Associated Graph Realizations." Doctoral thesis, Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-93599.

Повний текст джерела

Анотація:

This thesis deals with optimizing extremal eigenvalues of weighted graph Laplacian matrices. In general, the Laplacian matrix of a (weighted) graph is of particular importance in spectral graph theory and combinatorial optimization (e.g., graph partition like max-cut and graph bipartition). Especially the pioneering work of M. Fiedler investigates extremal eigenvalues of weighted graph Laplacians and provides close connections to the node- and edge-connectivity of a graph. Motivated by Fiedler, Göring et al. were interested in further connections between structural properties of the graph and

Стилі APA, Harvard, Vancouver, ISO та ін.

Wappler, Markus. "On Graph Embeddings and a new Minor Monotone Graph Parameter associated with the Algebraic Connectivity of a Graph." Doctoral thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-115518.

Повний текст джерела

Анотація:

We consider the problem of maximizing the second smallest eigenvalue of the weighted Laplacian of a (simple) graph over all nonnegative edge weightings with bounded total weight. We generalize this problem by introducing node significances and edge lengths. We give a formulation of this generalized problem as a semidefinite program. The dual program can be equivalently written as embedding problem. This is fifinding an embedding of the n nodes of the graph in n-space so that their barycenter is at the origin, the distance between adjacent nodes is bounded by the respective edge length, and the

Стилі APA, Harvard, Vancouver, ISO та ін.

Wappler, Markus [Verfasser], Christoph [Akademischer Betreuer] Helmberg, and Franz [Gutachter] Rendl. "On Graph Embeddings and a new Minor Monotone Graph Parameter associated with the Algebraic Connectivity of a Graph / Markus Wappler ; Gutachter: Franz Rendl ; Betreuer: Christoph Helmberg." Chemnitz : Universitätsbibliothek Chemnitz, 2013. http://d-nb.info/1214245757/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Reiß, Susanna [Verfasser], Christoph [Akademischer Betreuer] Helmberg, Christoph [Gutachter] Helmberg, and Monique [Gutachter] Laurent. "Optimizing Extremal Eigenvalues of Weighted Graph Laplacians and Associated Graph Realizations / Susanna Reiß ; Gutachter: Christoph Helmberg, Monique Laurent ; Betreuer: Christoph Helmberg." Chemnitz : Universitätsbibliothek Chemnitz, 2012. http://d-nb.info/121424419X/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gebhardt, René. "Unbounded operators on Hilbert C*-modules: graph regular operators." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-213767.

Повний текст джерела

Анотація:

Let E and F be Hilbert C*-modules over a C*-algebra A. New classes of (possibly unbounded) operators t: E->F are introduced and investigated - first of all graph regular operators. Instead of the density of the domain D(t) we only assume that t is essentially defined, that is, D(t) has an trivial ortogonal complement. Then t has a well-defined adjoint. We call an essentially defined operator t graph regular if its graph G(t) is orthogonally complemented and orthogonally closed if G(t) coincides with its biorthogonal complement. A theory of these operators and related concepts is developed: pol

Стилі APA, Harvard, Vancouver, ISO та ін.

Phillips, Jamie. "Graphs associated with sporadic group geometries, and the semisimple elements of E8(2)." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/graphs-associated-with-sporadic-group-geometries-and-the-semisimple-elements-of-e82(4e0d4eae-4fc5-472b-a564-a6ffe20fdb88).html.

Повний текст джерела

Анотація:

This thesis studies collinearity graphs and commuting involution graphs associated with sporadic group geometries, and the conjugacy classes of semisimple elements in the exceptional Lie-type group E8(2).First we construct plane-line collinearity graphs for the sporadic simple groups and their associated minimal and maximal 2-local parabolic geometries. For such a group and geometry, the plane-line collinearity graph takes all planes of the geometry as its vertices and joins two vertices with an edge if their planes are collinear in the geometry. We construct these graphs for the groups M23, J

Стилі APA, Harvard, Vancouver, ISO та ін.

Schulte-Sasse, Roman [Verfasser]. "Integration of multi-omics data with graph convolutional networks to identify cancer-associated genes / Roman Schulte-Sasse." Berlin : Freie Universität Berlin, 2021. http://nbn-resolving.de/urn:nbn:de:kobv:188-refubium-31311-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Iijima, Yu. "Some group-theoretic aspects of outer Galois representations associated to hyperbolic curves." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/199078.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

V, Kushnir O. "Exponential Functions as Mathematical Models." Thesis, National Aviation University, 2021. https://er.nau.edu.ua/handle/NAU/50740.

Повний текст джерела

Анотація:

1. Higher mathematics: manual / V. P. Denisiuk, V. M. Bobkov, L. I. Grishina and others. –K. : NAU, 2006. – Part 1. – 268 p. 2. Larson R. College Algebra / R. Larson, R. Hosteller. – Houghton Mifflin, 1997. – 545 p. 3. Mizrahi A. Calculus and Analytic Geometry / A. Mizrahi, M. Sullivan. – California: Wadsmonth Publishing Company, 1987. – 1083 p.<br>Exponential functions are useful in modeling many physical phenomena, such as populations, interest rates, radioactive decay, and the amount of medicine in the bloodstream. An exponential model is of the form A = A_0×bˆ(t/c) , w

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Associated graph"

Coolen, A. C. C., A. Annibale, and E. S. Roberts. Random graph ensembles. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0003.

Повний текст джерела

Анотація:

This chapter presents some theoretical tools for defining random graph ensembles systematically via soft or hard topological constraints including working through some properties of the Erdös-Rényi random graph ensemble, which is the simplest non-trivial random graph ensemble where links appear between two nodes with a fixed probability p. The chapter sets out the central representation of graph generation as the result of a discrete-time Markovian stochastic process. This unites the two flavours of graph generation approaches – because they can be viewed as simply moving forwards or backwards

Стилі APA, Harvard, Vancouver, ISO та ін.

Schneider, Saundra K., and William G. Jacoby. Graphical Displays for Public Opinion Research. Edited by Lonna Rae Atkeson and R. Michael Alvarez. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780190213299.013.10.

Повний текст джерела

Анотація:

This chapter takes steps toward promoting the effective use of graphical displays in journal articles and research monographs on public opinion and survey research. It provides specific advice and guidelines about determining when a graph would be useful for communicating quantitative information; features to consider in selecting a graph for displaying data or analytic results; and characteristics and details associated with specific types of graphs that help to maximize the information they convey to their audience. The overall objective is to encourage survey researchers and public opinion

Стилі APA, Harvard, Vancouver, ISO та ін.

cool, Ezra G. is. Accounting Associate Gift: Cute and Funny 6x9 100 Pages Graph Paper Notebook, Floral Design. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

cool, Ezra G. is. Associate Auditor Gift: Cute and Funny 6x9 100 Pages Graph Paper Notebook, Floral Design. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Notebooks, Gets. I Have Two Titles DAD and Accounting Associate: 6x9 Graph Paper Notebook Matte Finish Cover, 100 Blank Pages, Inches. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Publishing, Polyana. Accounting Associate Full Time Multitasking Wizard: 6x9 Inch Dot Graph Notebook 100 Pages, Perfect for Notes, Journaling, Gift for Co-Workers. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Vernizzi, Graziano, and Henri Orland. Complex networks. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.43.

Повний текст джерела

Анотація:

This article deals with complex networks, and in particular small world and scale free networks. Various networks exhibit the small world phenomenon, including social networks and gene expression networks. The local ordering property of small world networks is typically associated with regular networks such as a 2D square lattice. The small world phenomenon can be observed in most scale free networks, but few small world networks are scale free. The article first provides a brief background on small world networks and two models of scale free graphs before describing the replica method and how

Стилі APA, Harvard, Vancouver, ISO та ін.

Parrish, Geoffrey. Carburizing. ASM International, 1999. http://dx.doi.org/10.31399/asm.tb.cmp.9781627083379.

Повний текст джерела

Анотація:

Carburizing: Microstructures and Properties explains how to recognize and address problems associated with case carburizing treatments for steels. It examines the nature of internal oxidation, decarburization, free carbides, and retained austenite and their effect on fatigue and fracture strength, wear resistance, impact toughness, hardness, and other properties. It discusses the influence of grain size, microcracking, microsegregation, and nonmetallic inclusions and explains how composition and cooling rate determine the core properties of carburized steel parts and how alloy and carbon conte

Стилі APA, Harvard, Vancouver, ISO та ін.

Apple, Sophia K., and Lawrence W. Bassett. Normal Breast Anatomy and Histology. Edited by Christoph I. Lee, Constance D. Lehman, and Lawrence W. Bassett. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780190270261.003.0003.

Повний текст джерела

Анотація:

In this chapter, normal breast anatomy is discussed, with a succinct pictorial summary of breast glandular elements, the chest wall, and the axilla. The locations of breast lesions are often arbitrarily divided into upper outer, upper inner, lower inner, and upper inner quadrants. However, the lobes within a specific quadrant cross over into adjacent quadrants. The terminal duct lobular unit (TDLU) is composed of an interlobular duct and associated lobules with multiple grape-like structures where the milk is secreted and drains into the terminal ducts, interlobular ducts, excretory ducts, lac

Стилі APA, Harvard, Vancouver, ISO та ін.

Publishing, Uljana. I Never Asked to Be the World Best Accounting Associate but Here I Am: Graph Paper Notebook - Appreciation Gift for Colleagues - 100 Lined Pages, 6x9 Inches, Matte Soft Cover. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Associated graph"

Wallis, W. D. "Linear Spaces Associated with Graphs." In A Beginner’s Guide to Graph Theory. Birkhäuser Boston, 2007. http://dx.doi.org/10.1007/978-0-8176-4580-9_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wallis, W. D. "Linear Spaces Associated with Graphs." In A Beginner’s Guide to Graph Theory. Birkhäuser Boston, 2000. http://dx.doi.org/10.1007/978-1-4757-3134-7_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Acciani, Giuseppe, Girolamo Fornarelli, and Luciano Liturri. "Graph Adjacency Matrix Associated with a Data Partition." In Computational Science and Its Applications – ICCSA 2004. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24709-8_103.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Baird, Paul. "The Geometric Spectrum of a Graph and Associated Curvatures." In Modern Approaches to Discrete Curvature. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58002-9_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fukuzaki, Mutsumi, Mio Seki, Hisashi Kashima, and Jun Sese. "Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph." In Advances in Knowledge Discovery and Data Mining. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13672-6_15.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zheng, Kai, Zhu-Hong You, Lei Wang, Leon Wong, and Zhan-Heng Chen. "Inferring Disease-Associated Piwi-Interacting RNAs via Graph Attention Networks." In Intelligent Computing Theories and Application. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-60802-6_21.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Olteanu, Oana. "The Monomial Ideal of Independent Sets Associated to a Graph." In Springer Proceedings in Mathematics & Statistics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-90493-1_6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Schmidt, Miriam, Günther Palm, and Friedhelm Schwenker. "On Graph-Associated Matrices and Their Eigenvalues for Optical Character Recognition." In Artificial Neural Networks in Pattern Recognition. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33212-8_10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pae, Hye K. "Linguistic Evidence for Script Relativity." In Literacy Studies. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55152-0_8.

Повний текст джерела

Анотація:

Abstract Using the universal grammar of reading and the system accommodation hypothesis (Perfetti, 2003) as theoretical frameworks, this chapter reviews a wide range of linguistic evidence that supports script relativity. Universality and specificity found according to script features are discussed with respect to the operating principle (alphabet vs. logography), psycholinguistic gran size (phoneme vs. syllable), graph configuration (linearity vs. block), symbolic representation (arbitrariness vs. iconic quality), graph complexity (traditional characters vs. simplified characters), and multi-

Стилі APA, Harvard, Vancouver, ISO та ін.

Nerrise, Favour, Qingyu Zhao, Kathleen L. Poston, Kilian M. Pohl, and Ehsan Adeli. "An Explainable Geometric-Weighted Graph Attention Network for Identifying Functional Networks Associated with Gait Impairment." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43895-0_68.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Associated graph"

Tseng, Chien-Cheng, and Su-Ling Lee. "A Graph Signal Denoising Method Using Eigenvector Associated with Minimum Eigenvalue." In 2024 International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan). IEEE, 2024. http://dx.doi.org/10.1109/icce-taiwan62264.2024.10674332.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jiang, Yuanxiang, Mingjing Han, Yanbin Yin, and Han Zhang. "TMGE: a multi-view graph embedding model for prediction task of genes associated with neurodegenerative diseases." In 2024 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). IEEE, 2024. https://doi.org/10.1109/bibm62325.2024.10822336.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Barbastathis, George, Sandip Mondal, Thiara Sana Ahmed, et al. "On the Use of Machine Learning for Estimation of Complex Graph Networks and Flows, With Application to Retina Vasculature and Glaucoma Diagnostics." In Computational Optical Sensing and Imaging. Optica Publishing Group, 2024. https://doi.org/10.1364/cosi.2024.cf1a.1.

Повний текст джерела

Анотація:

We show that graph connectivity and the associated flow properties are mapped onto spatial and temporal fluctuations in the far field. The autocorrelation functions are processed by unsupervised and supervised algorithms to invert this mapping. Full-text article not available; see video presentation

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Guizhen, Zening Zhang, Chenglin Bai, and Lishan Yang. "Recovery Method of Missing Multivariable Time-varying Data Associated with Damaged Sensors by Graph Convolution Networks for Edge-computing based Industrial Internet of Things." In 2024 Sixth International Conference on Next Generation Data-driven Networks (NGDN). IEEE, 2024. http://dx.doi.org/10.1109/ngdn61651.2024.10744130.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Porrier, Carole, and Alexandre Blondin Masse. "The Leaf Function for Graphs Associated with Penrose Tilings." In 2019 First International Conference on Graph Computing (GC). IEEE, 2019. http://dx.doi.org/10.1109/gc46384.2019.00014.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Garimella, R. "Necessary conditions for graph isomorphism problem: polynomial time algorithms." In Stochastic Modeling and Applied Research of Technology. Crossref, 2023. http://dx.doi.org/10.57753/smarty.2023.10.52.005.

Повний текст джерела

Анотація:

In this research paper, it is proved that two arbitrary graphs are isomorphic only if the quadratic forms associated with the two adjacency matrices are same(upto reordering the monomials). Based on the proof, a polynomial time algorithm is designed for testing necessary condition for isomorphism of graph (i.e. effectively deciding whether two graphs are isomorphic). The algorithm requires O(N 3 ) comparison operations. Also, a polynomial time algorithm for checking necessary condition on whether two graphs are isomorphic is designed under the condition that the associated adjacency matrices a

Стилі APA, Harvard, Vancouver, ISO та ін.

IMPERATORE, DIANA. "On a graph associated with a group." In Proceedings of the Conference. WORLD SCIENTIFIC, 2009. http://dx.doi.org/10.1142/9789814277808_0008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dawood, Hayman Jassim, and Ali Abd Aubad. "On a graph associated to Ly group." In 3RD INTERNATIONAL CONFERENCE ON MATHEMATICS, AI, INFORMATION AND COMMUNICATION TECHNOLOGIES: ICMAICT2023. AIP Publishing, 2025. https://doi.org/10.1063/5.0258762.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Tasneem, Zareen, Farissa Tafannum, and Md Mahbubur Rahman. "Revised Scheme for Antimagic Graph Labeling for Splitting Graph and Shadow Graph Associated with Cycle." In 2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT). IEEE, 2019. http://dx.doi.org/10.1109/icasert.2019.8934741.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bertini Jr., João R., Alneu Lopes, and Liang Zhao. "Streaming Data Classification with the K-associated Graph." In 10. Congresso Brasileiro de Inteligência Computacional. SBIC, 2016. http://dx.doi.org/10.21528/cbic2011-27.2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Associated graph"

Brown, Zyglowicz, and Frantz. K83XPSQ Modeling of Damage in Gas Storage Wells. Pipeline Research Council International, Inc. (PRCI), 2003. http://dx.doi.org/10.55274/r0011218.

Повний текст джерела

Анотація:

The primary aim of this study is to addresses this specific question. In addition, this study also establishes techniques to conduct cost-benefit analyses on deliverability enhancement treatments, quantitatively determine the impact of operational changes on deliverability, and conduct comprehensive damage surveillance less expensively and therefore more frequently. The zip file contains the final report, the associated data that the analysis was performed on, and spreadsheets to analyze/graph the results.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz. Terminological cycles in a description logic with existential restrictions. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.120.

Повний текст джерела

Анотація:

Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language FL₀, which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This report investigates subsumption in the presence of terminological cycles for the language EL, which allows for conjunction and existential restrictions. In contrast to the results for FL₀, subsumption in EL remains polynomial, independent of wether we use least fixpoint s

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz. Least common subsumers, most specific concepts, and role-value-maps in a description logic with existential restrictions and terminological cycles. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.125.

Повний текст джерела

Анотація:

In a previous report we have investigates subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, and the top concept, and have shown that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics. This result depends on a characterization of subsumption through the existence of certain simulation relations on the graph associated with a terminology. In the present report we will use this characterization to show how the most specific

Стилі APA, Harvard, Vancouver, ISO та ін.

Aziz, Md Abdul, Sarah Jafrin, Md Abdul Barek, Shamima Nasrin Anonna, and Mohammad Safiqul Islam. The Association between Matrix Metalloproteinase-3 -1171 (5A/6A) Promoter Polymorphism and Cancer Susceptibility: An Updated Meta-Analysis and Trial Sequential Analysis. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, 2022. http://dx.doi.org/10.37766/inplasy2022.8.0049.

Повний текст джерела

Анотація:

Review question / Objective: The polymorphism of the 5A/6A promoter region of matrix metalloproteinases-3-1171 has been comprehensively studied to evaluate its risk associated with various cancers. We performed this updated meta-analysis to clarify the inconclusive outcomes of previous studies and to verify the link of this specific variant with the cancer risk. Eligibility criteria: For the literature covered in this meta-analysis, the authors followed some standards as inclusion criteria: (a) comparative case-control or cohort (different case groups) studies stating the correlation of MMP-3

Стилі APA, Harvard, Vancouver, ISO та ін.

Flowerday, Kaelyn. Unfolding Trees and Symmetrically-Associated Graphs. Portland State University Library, 2015. http://dx.doi.org/10.15760/honors.210.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cram, Jana, Mary Levandowski, Kaci Fitzgibbon, and Andrew Ray. Water resources summary for the Snake River and Jackson Lake Reservoir in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway: Preliminary analysis of 2016 data. National Park Service, 2021. http://dx.doi.org/10.36967/nrr-2285179.

Повний текст джерела

Анотація:

This report summarizes discharge and water quality monitoring data for the Snake River and Jackson Lake reservoir levels in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway for calendar year 2016. Annual and long-term discharge summaries and an evaluation of chemical conditions relative to state and federal water quality standards are presented. These results are considered provisional, and may be subject to change. River Discharge: Hydrographs for the Snake River at Flagg Ranch, WY, and Moose, WY, exhibit a general pattern of high early summer flows and lower baseflows

Стилі APA, Harvard, Vancouver, ISO та ін.

Fait, Aaron, Grant Cramer, and Avichai Perl. Towards improved grape nutrition and defense: The regulation of stilbene metabolism under drought. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7594398.bard.

Повний текст джерела

Анотація:

The goals of the present research proposal were to elucidate the physiological and molecular basis of the regulation of stilbene metabolism in grape, against the background of (i) grape metabolic network behavior in response to drought and of (ii) varietal diversity. The specific objectives included the study of the physiology of the response of different grape cultivars to continuous WD; the characterization of the differences and commonalities of gene network topology associated with WD in berry skin across varieties; the study of the metabolic response of developing berries to continuous WD

Стилі APA, Harvard, Vancouver, ISO та ін.

Turgeon, Mathieu. Causal Modeling with Regression Discontinuity Designs (RDD). Instats Inc., 2023. http://dx.doi.org/10.61700/s3nl5lfnmruqw469.

Повний текст джерела

Анотація:

This seminar introduces the use of the regression discontinuity design (RDD) to estimate treatment effects from observational data. Day 1 topics include directed acyclic graphs (DAG), potential outcomes framework and associated assumptions, the sharp regression discontinuity design, and tools for visualizing discontinuities. Day 2 topics focus on the estimation of values of interest from a regression discontinuity design, adopting a continuity-based approach to RD analysis. Day 2 will also cover issues related to the validation and falsification of the regression discontinuity design. An offic

Стилі APA, Harvard, Vancouver, ISO та ін.

Turgeon, Mathieu. Causal Modeling with Regression Discontinuity Designs (RDD). Instats Inc., 2023. http://dx.doi.org/10.61700/o6e22r1sh4h7m469.

Повний текст джерела

Анотація:

This seminar introduces the use of the regression discontinuity design (RDD) to estimate treatment effects from observational data. Sessions 1-3 topics include directed acyclic graphs (DAG), potential outcomes framework and associated assumptions, the sharp regression discontinuity design, and tools for visualizing discontinuities. Sessions 4-6 topics focus on the estimation of values of interest from a regression discontinuity design, adopting a continuity-based approach to RD analysis. Day 2 will also cover issues related to the validation and falsification of the regression discontinuity de

Стилі APA, Harvard, Vancouver, ISO та ін.

Mawassi, Munir, Baozhong Meng, and Lorne Stobbs. Development of Virus Induced Gene Silencing Tools for Functional Genomics in Grapevine. United States Department of Agriculture, 2013. http://dx.doi.org/10.32747/2013.7613887.bard.

Повний текст джерела

Анотація:

Grapevine is perhaps the most widely grown fruit crop. To understand the genetic make-up so as to improve the yield and quality of grapes and grape products, researchers in Europe have recently sequenced the genomes of Pinot noir and its inbred. As expected, function of many grape genes is unknown. Functional genomics studies have become the major focus of grape researchers and breeders. Current genetic approaches for gene function studies include mutagenesis, crossing and genetic transformation. However, these approaches are difficult to apply to grapes and takes long periods of time to accom

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!