Log in

Relevant bibliographies by topics / Graph realization

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers
Reports

Academic literature on the topic 'Graph realization'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph realization.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph realization"

1

Kaliszewski, S., Alex Kumjian, John Quigg, and Aidan Sims. "Topological realizations and fundamental groups of higher-rank graphs." Proceedings of the Edinburgh Mathematical Society 59, no. 1 (2015): 143–68. http://dx.doi.org/10.1017/s0013091515000061.

Full text

Abstract:

AbstractWe investigate topological realizations of higher-rank graphs. We show that the fundamental group of a higher-rank graph coincides with the fundamental group of its topological realization. We also show that topological realization of higher-rank graphs is a functor and that for each higher-rank graphΛ, this functor determines a category equivalence between the category of coverings ofΛand the category of coverings of its topological realization. We discuss how topological realization relates to two standard constructions fork-graphs: projective limits and crossed products by finitely

APA, Harvard, Vancouver, ISO, and other styles

2

Sanli, Utkum, Feriha Celik, Sadik Delen, and Ismail Cangul. "Connectedness criteria for graphs by means of omega invariant." Filomat 34, no. 2 (2020): 647–52. http://dx.doi.org/10.2298/fil2002647s.

Full text

Abstract:

A realizable degree sequence can be realized in many ways as a graph. There are several tests for determining realizability of a degree sequence. Up to now, not much was known about the common properties of these realizations. Euler characteristic is a well-known characteristic of graphs and their underlying surfaces. It is used to determine several combinatorial properties of a surface and of all graphs embedded onto it. Recently, last two authors defined a number ? which is invariant for all realizations of a given degree sequence. ? is shown to be related to Euler characteristic and cycloma

APA, Harvard, Vancouver, ISO, and other styles

3

KOPPELMAN, DAVID M. "A LOWER BOUND ON THE AVERAGE PHYSICAL LENGTH OF EDGES IN THE PHYSICAL REALIZATION OF GRAPHS." Parallel Processing Letters 06, no. 01 (1996): 137–43. http://dx.doi.org/10.1142/s0129626496000145.

Full text

Abstract:

The stereo-realization of a graph is the assignment of positions in Cartesian space to each of its vertices such that vertex density is bounded. A bound is derived on the average edge length in such a realization. It is similar to an earlier reported result, however the new bound can be applied to graphs for which the earlier result is not well suited. A more precise realization definition is also presented. The bound is applied to d-dimensional realizations of de Bruijn graphs, yielding an edge length of Ω((1−2−d)rn/d/(2n)), where r is the radix (number of distinct symbols) and n is the numbe

APA, Harvard, Vancouver, ISO, and other styles

4

SONG, ZI-XIA. "PARTIAL RESULT ON HADWIGER'S CONJECTURE." Discrete Mathematics, Algorithms and Applications 02, no. 03 (2010): 413–23. http://dx.doi.org/10.1142/s1793830910000759.

Full text

Abstract:

Let D = (d1, d2, …, dn) be a graphic sequence with 0 ≤ d1 ≤ d2 ≤ ⋯ ≤ dn. Any simple graph G with D its degree sequence is called a realization of D. Let R[D] denote the set of all realizations of D. We say that D is H-free if no graph in R[D] contains H as an induced subgraph. In this paper, we prove that Hadwiger's Conjecture is true for graphs whose degree sequences are claw-free or [Formula: see text]-free.

APA, Harvard, Vancouver, ISO, and other styles

5

Beaman, J. J., and R. C. Rosenberg. "Constitutive and Modulation Structure in Bond Graph Modeling." Journal of Dynamic Systems, Measurement, and Control 110, no. 4 (1988): 395–402. http://dx.doi.org/10.1115/1.3152702.

Full text

Abstract:

In this paper, we investigate additional structure that might be put on bond graphs in order that (1) a bond graph has a physical realization and (2) physical realizations have bond graph within an appropriate physical domain. In particular, restrictions are proposed on the allowed form for the constitutive laws for energy storing and dissipative elements and the allowed form for the modulation of coupling elements. This added structure is proposed to ensure the existence of an energy state function, passivity, unique solutions to the model equations, and to preserve the signal nature of modul

APA, Harvard, Vancouver, ISO, and other styles

6

Karpenkov, Oleg. "The Combinatorial Geometry of Stresses in Frameworks." Discrete & Computational Geometry 65, no. 1 (2020): 43–89. http://dx.doi.org/10.1007/s00454-020-00234-8.

Full text

Abstract:

AbstractConsider a realization of a graph in the space with straight segments representing edges. Let us assign a stress for every its edge. In case if at every vertex of the graph the stresses sum up to zero, we say that the realization is a tensegrity. Some realizations possess non-zero tensegrities while the others do not. In this paper we study necessary and sufficient existence conditions for tensegrities in the plane. For an arbitrary graph we write down these conditions in terms of projective “meet-join” operations.

APA, Harvard, Vancouver, ISO, and other styles

7

Devadoss, Satyan L. "A realization of graph associahedra." Discrete Mathematics 309, no. 1 (2009): 271–76. http://dx.doi.org/10.1016/j.disc.2007.12.092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bhat, K. Arathi, and G. Sudhakara. "Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )." Special Matrices 6, no. 1 (2018): 343–56. http://dx.doi.org/10.1515/spma-2018-0028.

Full text

Abstract:

Abstract In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is realizable as a graph if and only if P satis_es perfect matching property. For A(G)A(GPk ) = A(Γ) for some graph Γ, we obtain graph parameters such as chromatic number, domination number etc., for those graphs and characterization of P is given for which GPk and Γ are isomorphic. Given a 1-factor graph G with 2n vertices, we propose a p

APA, Harvard, Vancouver, ISO, and other styles

9

Liu, Yuqing, and Nicholas A. Scoville. "The Realization Problem for Discrete Morse Functions on Trees." Algebra Colloquium 27, no. 03 (2020): 455–68. http://dx.doi.org/10.1142/s1005386720000371.

Full text

Abstract:

We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We compare this notion of equivalence to other notions of equivalent discrete Morse functions. Then we compute an upper bound for the number of persistence equivalent discrete Morse functions on a fixed graph and show that this upper bound is sharp in the case where our graph is a tree. This is a version of the “realization problem” of the persistence map. We conclude with an e

APA, Harvard, Vancouver, ISO, and other styles

10

de Rezende, K. A. "Gradient-like flows on 3-manifolds." Ergodic Theory and Dynamical Systems 13, no. 3 (1993): 557–80. http://dx.doi.org/10.1017/s0143385700007525.

Full text

Abstract:

AbstractIn this paper, we determine properties that a Lyapunov graph must satisfy for it to be associated with a gradient-like flow on a closed orientable three-manifold. We also address the question of the realization of abstract Lyapunov graphs as gradient-like flows on three-manifolds and as a byproduct we prove a partial converse to the theorem which states the Morse inequalities for closed orientable three-manifolds. We also present cancellation theorems of non-degenerate critical points for flows which arise as realizations of canonical abstract Lyapunov graphs.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Graph realization"

1

McJannet, Lawrence George 1952. "REALIZATION OF A REGULAR FACILITY BLOCK PLAN FROM AN ADJACENCY GRAPH USING GRAPH THEORETIC BASED HEURISTICS." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/275537.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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.

Full text

Abstract:

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, and other styles

3

So, Anthony Man-Cho. "A semidefinite programming approach to the graph realization problem : theory, applications and extensions /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Saleem, Jawad, and Abdul Mateen Malik. "REALIZATION OF CASCADE OF RESONATORS WITH DISTRBUTED FEED-BACK SIGMA-DELTA." Thesis, Department of Electrical Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-20289.

Full text

Abstract:

<p>The Sigma Delta Modulator (SDM) based analog to digital conversion is cost effective and have the advantages as higher reliability, increased functionality, and reduction in chip cost.</p><p>The thesis work includes the modeling of SDM with the signal flow graph in Matlab, optimization of the coefficients to improve the noise transfer function and signal transfer function. A procedure to find the maximum stable input range for the design. Scaling the inputs of the integrator so that the maximum output signal can be obtained according to the operational transconductance amplifier (OTA) outpu

APA, Harvard, Vancouver, ISO, and other styles

5

Lesser, Alice. "Optimal and Hereditarily Optimal Realizations of Metric Spaces." Doctoral thesis, Uppsala University, Department of Mathematics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8297.

Full text

Abstract:

<p>This PhD thesis, consisting of an introduction, four papers, and some supplementary results, studies the problem of finding an <i>optimal realization</i> of a given finite metric space: a weighted graph which preserves the metric's distances and has minimal total edge weight. This problem is known to be NP-hard, and solutions are not necessarily unique.</p><p>It has been conjectured that <i>extremally weighted</i> optimal realizations may be found as subgraphs of the <i>hereditarily optimal realization</i> Γ<sub>d</sub>, a graph which in general has a higher total edge weight than the optim

APA, Harvard, Vancouver, ISO, and other styles

6

Saleem, Jawad, and Abdul Mateen Malik. "Realization of Cascade of Resonators with Distributed Feed-Back Sigma-Delta." Thesis, Linköpings universitet, Institutionen för systemteknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-20289.

Full text

Abstract:

The Sigma Delta Modulator (SDM) based analog to digital conversion is cost effective and have the advantages as higher reliability, increased functionality, and reduction in chip cost. The thesis work includes the modeling of SDM with the signal flow graph in Matlab, optimization of the coefficients to improve the noise transfer function and signal transfer function. A procedure to find the maximum stable input range for the design. Scaling the inputs of the integrator so that the maximum output signal can be obtained according to the operational transconductance amplifier (OTA) output range.

APA, Harvard, Vancouver, ISO, and other styles

7

Murphy, Kaitlin S. "On Fractional Realizations of Tournament Score Sequences." DigitalCommons@USU, 2019. https://digitalcommons.usu.edu/etd/7592.

Full text

Abstract:

Contrary to popular belief, we can’t all be winners. Suppose 6 people compete in a chess tournament in which all pairs of players compete directly and no ties are allowed; i.e., 6 people compete in a ‘round robin tournament’. Each player is assigned a ‘score’, namely the number of games they won, and the ‘score sequence’ of the tournament is a list of the players’ scores. Determining whether a given potential score sequence actually is a score sequence proves to be difficult. For instance, (0, 0, 3, 3, 3, 6) is not feasible because two players cannot both have score 0. Neither is the sequence

APA, Harvard, Vancouver, ISO, and other styles

8

Fischermann, Miranca. "Domination parameters and their unique realizations." [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=964904160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lesser, Alice. "Hereditarily optimal realizations /." Uppsala, 2004. http://www.math.uu.se/research/pub/Lesser1.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Schwartz, David Aaron. "Synchronous multiprocessor realizations of shift-invariant flow graphs." Diss., Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/13021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph realization"

1

de Mendez, Patrice Ossona. "Geometric Realization of Simplicial Complexes." In Graph Drawing. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46648-7_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Nabi-Abdolyousefi, Marzieh. "Network Identification via Graph Realization." In Controllability, Identification, and Randomness in Distributed Systems. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-02429-5_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Korach, Ephraim, and Margarita Razgon. "Optimal Hypergraph Tree-Realization." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11604686_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cucuringu, Mihai. "ASAP: An Eigenvector Synchronization Algorithm for the Graph Realization Problem." In Distance Geometry. Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-5128-0_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Czyzowicz, Jurek, Evangelos Kranakis, Danny Krizanc, and Jorge Urrutia. "Discrete realizations of contact and intersection graphs (extended abstract)." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63938-1_81.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Abellanas, Manuel, and Carlos Moreno-Jiménez. "Geometric Graphs Realization as Coin Graphs." In Computational Science and Its Applications – ICCSA 2004. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24767-8_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bar-Noy, Amotz, Toni Böhnlein, David Peleg, and Dror Rawitz. "On Vertex-Weighted Graph Realizations." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75242-2_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bar-Noy, Amotz, Toni Böhnlein, David Peleg, Mor Perry, and Dror Rawitz. "Relaxed and Approximate Graph Realizations." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79987-8_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Brézillon, Patrick. "Task-Realization Models in Contextual Graphs." In Modeling and Using Context. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11508373_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bar-Noy, Amotz, David Peleg, Mor Perry, and Dror Rawitz. "Composed Degree-Distance Realizations of Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79987-8_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph realization"

1

Zhao, Jinman, Gerald Penn, and Huan Ling. "Structural Realization with GGNNs." In Proceedings of the Fifteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-15). Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/11.textgraphs-1.11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Nabi-Abdolyousefi, Marzieh, Maryam Fazel, and Mehran Mesbahi. "A graph realization approach to network identification." In 2012 IEEE 51st Annual Conference on Decision and Control (CDC). IEEE, 2012. http://dx.doi.org/10.1109/cdc.2012.6425884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhou, Faguo, Fan Zhang, and Bingru Yang. "Graph-based text representation model and its realization." In 2010 International Conference on Natural Language Processing and Knowledge Engineering (NLP-KE). IEEE, 2010. http://dx.doi.org/10.1109/nlpke.2010.5587861.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yang, Ting-Ya, and Houshou Chen. "Graph realization of reed-muller codes for data hiding." In 2015 International Symposium on Next-Generation Electronics (ISNE). IEEE, 2015. http://dx.doi.org/10.1109/isne.2015.7131977.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Cordonnier, Jean-Baptiste, and Andreas Loukas. "Extrapolating Paths with Graph Neural Networks." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/303.

Full text

Abstract:

We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the interaction of an agent with a network---a driver on the transportation network, an information seeker in Wikipedia, or a client in an online shop. Our interest is sparked by the realization that, in contrast to shortest-path problems, natural paths are usually not optimal in any graph-theoretic sense, but might still follow predictable patterns

APA, Harvard, Vancouver, ISO, and other styles

6

Ding, Yichuan, Nathan Krislock, Jiawei Qian, and Henry Wolkowicz. "Sensor network localization, euclidean distance matrix completions, and graph realization." In the first ACM international workshop. ACM Press, 2008. http://dx.doi.org/10.1145/1410012.1410042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Abi Zeid Daou, Roy, Clovis Francis, and Xavier Moreau. "Fractional operators' synthesis and realization using electrical and Bond Graph approaches." In 2009 International Conference on Advances in Computational Tools for Engineering Applications (ACTEA). IEEE, 2009. http://dx.doi.org/10.1109/actea.2009.5227950.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Du, Wenchao, and Alan W. Black. "Learning to Order Graph Elements with Application to Multilingual Surface Realization." In Proceedings of the 2nd Workshop on Multilingual Surface Realisation (MSR 2019). Association for Computational Linguistics, 2019. http://dx.doi.org/10.18653/v1/d19-6302.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kang Jiandong, Li Yalou, and Mu Lianshun. "Study and realization of Dynamic Security Assessment system Graph-Data integration platform." In 2010 International Conference on Power System Technology - (POWERCON 2010). IEEE, 2010. http://dx.doi.org/10.1109/powercon.2010.5666131.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

WU, CHANGTI, CHUNFANG LI, and WENJUAN JIANG. "The Realization of Cross-Media Knowledge Graph of Tang and Song Poetry." In 2020 International Conference on Machine Learning and Cybernetics (ICMLC). IEEE, 2020. http://dx.doi.org/10.1109/icmlc51923.2020.9469590.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graph realization"

1

Bixby, Robert E., and Donald K. Wagner. An Almost Linear-Time Algorithm for Graph Realization. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada455177.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!