Relevant bibliographies by topics / Geodetic graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Geodetic graphs'

Author: Grafiati
Published: 5 June 2025
Last updated: 1 August 2025

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 'Geodetic graphs.'

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 "Geodetic graphs"

1

Gajavalli, S., and A. Berin Greeni. "On Geodesic Convexity in Mycielskian of Graphs." Journal of Advanced Computational Intelligence and Intelligent Informatics 27, no. 1 (2023): 119–23. http://dx.doi.org/10.20965/jaciii.2023.p0119.

Full text
Abstract:
The convexity induced by the geodesics in a graph G is called the geodesic convexity of G. Mycielski graphs preserve the property of being triangle-free and many parameters such as power domination number, coloring number, determining number and recently general position number have been determined for them. In this work, we determine the geodesic convexity parameters viz., convexity, geodetic iteration, geodetic, and hull numbers for Mycielski graphs for which the underlying graphs considered are path, cycle, star, and complete graph.
APA, Harvard, Vancouver, ISO, and other styles
2

González, Yero, and Magdalena Lemńska. "Convex dominating-geodetic partitions in graphs." Filomat 30, no. 11 (2016): 3075–82. http://dx.doi.org/10.2298/fil1611075g.

Full text
Abstract:
The distance d(u,v) between two vertices u and v in a connected graph G is the length of a shortest u-v path in G. A u-v path of length d(u,v) is called u-v geodesic. A set X is convex in G if vertices from all a -b geodesics belong to X for every two vertices a,b?X. A set of vertices D is dominating in G if every vertex of V-D has at least one neighbor in D. The convex domination number con(G) of a graph G equals the minimum cardinality of a convex dominating set in G. A set of vertices S of a graph G is a geodetic set of G if every vertex v ? S lies on a x-y geodesic between two vertices x,y
APA, Harvard, Vancouver, ISO, and other styles
3

Ge, Huifen, Zhao Wang, and Jinyu Zou. "Strong Geodetic Number in Some Networks." Journal of Mathematics Research 11, no. 2 (2019): 20. http://dx.doi.org/10.5539/jmr.v11n2p20.

Full text
Abstract:
A vertex subset S of a graph is called a strong geodetic set if there exists a choice of exactly one geodesic for each pair of vertices of S in such a way that these (|S| 2) geodesics cover all the vertices of graph G. The strong geodetic number of G, denoted by sg(G), is the smallest cardinality of a strong geodetic set. In this paper, we give an upper bound of strong geodetic number of the Cartesian product graphs and study this parameter for some Cartesian product networks.
APA, Harvard, Vancouver, ISO, and other styles
4

Ganesamoorthy, K., and D. Jayanthi. "Extreme Outer Connected Geodesic Graphs." Proyecciones (Antofagasta) 43, no. 1 (2024): 103–17. http://dx.doi.org/10.22199/issn.0717-6279-5401.

Full text
Abstract:
For a connected graph G of order at least two, a set S of vertices in a graph G is said to be an outer connected geodetic set if S is a geodetic set of G and either S = V or the subgraph induced by V − S is connected. The minimum cardinality of an outer connected geodetic set of G is the outer connected geodetic number of G and is denoted by goc(G). The number of extreme vertices in G is its extreme order ex(G). A graph G is said to be an extreme outer connected geodesic graph if goc(G) = ex(G). It is shown that for every pair a, b of integers with 0 ≤ a ≤ b and b ≥ 2, there exists a connected
APA, Harvard, Vancouver, ISO, and other styles
5

Titus, P., and A. P. Santhakumaran. "Extreme Monophonic Graphs and Extreme Geodesic Graphs." Tamkang Journal of Mathematics 47, no. 4 (2016): 393–404. http://dx.doi.org/10.5556/j.tkjm.47.2016.2045.

Full text
Abstract:
For a connected graph $G=(V,E)$ of order at least two, a chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A monophonic set of $G$ is a set $S$ of vertices such that every vertex of $G$ lies on a monophonic path joining some pair of vertices in $S$. The monophonic number of $G$ is the minimum cardinality of its monophonic sets and is denoted by $m(G)$. A geodetic set of $G$ is a set $S$ of vertices such that every vertex of $G$ lies on a geodesic joining some pair of vertices in $S$. The geodetic number of
APA, Harvard, Vancouver, ISO, and other styles
6

Adolfo, Niña Jeane, Imelda Aniversario, and Ferdinand Jamil. "Closed Geodetic Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 17, no. 3 (2024): 1618–36. http://dx.doi.org/10.29020/nybg.ejpam.v17i3.5241.

Full text
Abstract:
Let G be a simple, undirected and connected graph. A subset S ⊆ V (G) is a geodetic cover of G if IG[S] = V (G), where IG[S] is the set of all vertices of G lying on any geodesic between two vertices in S. A geodetic cover S of G is a closed geodetic cover if the vertices in S are sequentially selected as follows: Select a vertex v1 and let S1 = {v1}. If G is nontrivial, select a vertex v2 ̸= v1 and let S2 = {v1, v2}. Where possible, for i ≥ 3, successively select vertex vi ∈/ IG[Si−1] and let Si = {v1, v2, ..., vi}. Then there exists a positive integer k such that Sk = S. A geodetic cover S o
APA, Harvard, Vancouver, ISO, and other styles
7

Catian, Dyjay Bill, Imelda Aniversario, and Ferdinand Jamil. "On Minimal Geodetic Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 17, no. 3 (2024): 1737–50. http://dx.doi.org/10.29020/nybg.ejpam.v17i3.5251.

Full text
Abstract:
Let $G$ be a nontrivial connected graph with vertex set $V(G)$. A set $S \subseteq V(G)$ is a geodetic hop dominating set of $G$ if the following two conditions hold for each $x\in V(G)\setminus S$: $(1)$ $x$ lies in some $u$-$v$ geodesic in $G$ with $u,v\in S$, and $(2)$ $x$ is of distance $2$ from a vertex in $S$. The minimum cardinality $\gamma_{hg}(G)$ of a geodetic hop dominating set of $G$ is the geodetic hop domination number of $G$. A geodetic hop dominating set $S$ is a minimal geodetic hop dominating set if $S$ does not contain a proper subset that is itself geodetic hop dominating s
APA, Harvard, Vancouver, ISO, and other styles
8

SANTHAKUMARAN, A. P. "EXTREME STEINER GRAPHS." Discrete Mathematics, Algorithms and Applications 04, no. 02 (2012): 1250029. http://dx.doi.org/10.1142/s1793830912500292.

Full text
Abstract:
For a connected graph G of order p ≥ 2 and a set W ⊆ V(G), a tree T contained in G is a Steiner tree with respect to W if T is a tree of minimum order with W ⊆ V(T). The set S(W) consists of all vertices in G that lie on some Steiner tree with respect to W. The set W is a Steiner set for G if S(W) = V(G). The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. A geodetic set of G is a set S of vertices such that every vertex of G is contained in a geodesic joining some pair of vertices of S. The geodetic
APA, Harvard, Vancouver, ISO, and other styles
9

Nebeský, Ladislav. "A characterization of geodetic graphs." Czechoslovak Mathematical Journal 45, no. 3 (1995): 491–93. http://dx.doi.org/10.21136/cmj.1995.128536.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gnana Santhiyagu, G. Micheal Antony, S. Balamurugan, and R. Arul Ananthan. "Changing and Unchanging the Geodetic Number: Edge Removal." Mapana Journal of Sciences 22, no. 4 (2024): 115–21. https://doi.org/10.12723/mjs.67.8.

Full text
Abstract:
Let S be a collection of elements in a vertex set V. If every vertex in a graph G falls on a geodesic connecting two vertices from S, then that graph is said to be a geodesic set. g(G) is the smallest cardinality of the geodesic subset of a graph G is known as the geodetic number. This study investigates how the removal of an edge affects some unique families of graphs' geodetic numbers.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Geodetic graphs"

1

Aurand, Eric William. "Infinite Planar Graphs." Thesis, University of North Texas, 2000. https://digital.library.unt.edu/ark:/67531/metadc2545/.

Full text
Abstract:
How many equivalence classes of geodesic rays does a graph contain? How many bounded automorphisms does a planar graph have? Neimayer and Watkins studied these two questions and answered them for a certain class of graphs. Using the concept of excess of a vertex, the class of graphs that Neimayer and Watkins studied are extended to include graphs with positive excess at each vertex. The results of this paper show that there are an uncountable number of geodesic fibers for graphs in this extended class and that for any graph in this extended class the only bounded automorphism is the identi
APA, Harvard, Vancouver, ISO, and other styles
2

Al, Abri Al Jalila. "Pairs of closed geodesics in metric graphs." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/95503/.

Full text
Abstract:
In this thesis we are interested in the problem of counting pairs of closed geodesics in metric graphs. We start with counting pairs of closed geodesics ordered by their word length on the metric graph and such that the difference of their geometric lengths is in a prescribed interval. Then we study a similar problem but where the interval is now allowed to shrink at a specific rate as the word length tends to infinity. Next we study a variant on this problem where we fix a set of generators for the fundamental group of the graph and then order the closed geodesics by the word length of the co
APA, Harvard, Vancouver, ISO, and other styles
3

edu, Laurent@math berkeley. "Growth Series and Random Walks on Some Hyperbolic Graphs." ESI preprints, 2001. ftp://ftp.esi.ac.at/pub/Preprints/esi1075.ps.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Barancová, Simona. "3D model vybraného objektu." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2017. http://www.nusl.cz/ntk/nusl-390214.

Full text
Abstract:
The aim of this thesis is creation of 3D model by a selected program. In the introduction of the thesis is a brief description of chosen object – St. Václav's temple in Brno. Next follows preparation works before measuring, creating of measuring net by GNSS and measuring of object by tachymetric method. In the following chapters is briefly described 2D and 3D computer graphic and program AutoCAD Civil 3D, which was used for create resulting model of the object.
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Rui, and 王睿. "Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B48330139.

Full text
Abstract:
The medial axis is an important shape representation and the computation of the medial axis is a fundamental research problem in computer graphics. Practically, the medial axis is widely used in various aspects of computer graphics, such as shape analysis, image segmentation, skeleton extraction and mesh generation and so forth. However, the applications of the medial axis have been limited by its sensitivity to boundary perturbations. This characteristic may lead to a number of noise branches and increase the complexity of the medial axis. To solve the sensitivity problem, it is critical to
APA, Harvard, Vancouver, ISO, and other styles
6

Marcille, Clara. "Problèmes de distinction et de détection dans les graphes." Electronic Thesis or Diss., Bordeaux, 2025. http://www.theses.fr/2025BORD0101.

Full text
Abstract:
Cette thèse traite de deux domaines à part en théorie des graphes. Dans la première partie, nous étudions l’irrégularité des graphes comme antonyme de la régularité. Nous nous concentrons sur des façons établies de distinguer les sommets adjacents par leurs degrés. Seuls certains graphes ont la propriété d’avoir toute paire de sommets adjacents de degrés distincts. Nous introduisons des façons d’étiqueter les arêtes d’un graphe, et considérons une fonction des étiquettes de ses arêtes incidentes au lieu du degré. Nous l’appelons somme résultante, et demandons qu’elle soit différente pour toute
APA, Harvard, Vancouver, ISO, and other styles
7

Magna, Júnior João Paulo [UNESP]. "Modelagem de distorções entre realizações de referenciais geodésicos." Universidade Estadual Paulista (UNESP), 2007. http://hdl.handle.net/11449/86792.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:22:25Z (GMT). No. of bitstreams: 0 Previous issue date: 2007-04-24Bitstream added on 2014-06-13T19:06:24Z : No. of bitstreams: 1 magnajr_jp_me_prud.pdf: 1562358 bytes, checksum: 707020e37c54b516d7377926b9cefee2 (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>Os avanços tecnológicos nos métodos de posicionamento, sobretudo os sistemas de posicionamento por satélite, fizeram com que diversos países atualizassem e/ou revisassem suas estruturas geodésicas fundamentais. Na busca de explorar a total potencialidade das novas
APA, Harvard, Vancouver, ISO, and other styles
8

Gledel, Valentin. "Couverture de sommets sous contraintes." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1130.

Full text
Abstract:
Cette thèse porte sur le problème de la couverture d'ensembles finis dans une structure discrète. Cette problématique très générale permet de nombreuses approches et nous faisons l'étude de certaines d'entre elles. Le premier chapitre introduit les notions qui seront indispensables à la bonne compréhension de cette thèse et fait un bref état de l'art sur certains problèmes de couvertures, en particulier le problème de domination dans les graphes. Le second chapitre aborde la domination de puissance, une variante du problème de domination qui a la particularité qu'on lui adjoint un phénomène de
APA, Harvard, Vancouver, ISO, and other styles
9

Braz, Caio de Moraes. "Segmentação de imagens pela transformada imagem-floresta com faixa de restrição geodésica." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-01062016-104354/.

Full text
Abstract:
Vários métodos tradicionais de segmentação de imagens, como a transformada de watershed de marcado- res e métodos de conexidade fuzzy (Relative Fuzzy Connectedness- RFC, Iterative Relative Fuzzy Connected- ness - IRFC), podem ser implementados de modo eficiente utilizando o método em grafos da Transformada Imagem-Floresta (Image Foresting Transform - IFT). No entanto, a carência de termos de regularização de fronteira em sua formulação fazem com que a borda do objeto segmentado possa ser altamente irregular. Um modo de contornar isto é por meio do uso de restrições de forma do objeto, que favo
APA, Harvard, Vancouver, ISO, and other styles
10

Nascimento, Julliano Rosa. "O número envoltório P3 e o número envoltório geodético em produtos de grafos." Universidade Federal de Goiás, 2016. http://repositorio.bc.ufg.br/tede/handle/tede/6583.

Full text
Abstract:
Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2016-12-09T16:43:52Z No. of bitstreams: 2 Dissertação - Julliano Rosa Nascimento - 2016.pdf: 1812313 bytes, checksum: 9bdaa6ddbbe1dd9ce1e9ccdea8016eaf (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2016-12-13T19:11:50Z (GMT) No. of bitstreams: 2 Dissertação - Julliano Rosa Nascimento - 2016.pdf: 1812313 bytes, checksum: 9bdaa6ddbbe1dd9ce1e9ccdea8016eaf (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Geodetic graphs"

1

Pelayo, Ignacio M. Geodesic Convexity in Graphs. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8699-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

B, Taylor Richard, ed. System 8: GSLITH and related programs ... for the IBM PC and compatible microcomputers to assist workers in the earth sciences in management of drill data located with geodetic coordinates : provides for drawing of sections and plan views, and export of ASCII files for contouring. 8th ed. U.S. Dept. of the Interior, Geological Survey, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pelayo, Ignacio M. M. Geodesic Convexity in Graphs. Springer, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pelayo, Ignacio M. Geodesic Convexity in Graphs. Springer, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pelayo, Ignacio M. Geodesic Convexity in Graphs. Springer London, Limited, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

System 8: Programs to assist workers in the earth sciences in using geodetic or Cartesian XYZ data from row column (GSPV85) files; GSPDC, contours, and grids interpolated from triangulated network; GSPCS, graphic sections; GSPUV, univariant statistics and histograms; GSPROB, probability diagrams; GSPXY, regression statistics and XY plots; GSPTD, ternary diagrams; and GSPV85 post-plots, for IBM PC compatible computers. Dept. of the Interior, U.S. Geological Survey, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Geodetic graphs"

1

Brešar, Boštjan, Matjaž Kovše, and Aleksandra Tepeh. "Geodetic Sets in Graphs." In Structural Analysis of Complex Networks. Birkhäuser Boston, 2010. http://dx.doi.org/10.1007/978-0-8176-4789-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Blokhuis, A., and A. E. Brouwer. "Geodetic Graphs of Diameter Two." In Geometries and Groups. Springer Netherlands, 1988. http://dx.doi.org/10.1007/978-94-009-4017-8_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Foucaud, Florent, Krishna Narayanan, and Lekshmi Ramasubramony Sulochana. "Monitoring Edge-Geodetic Sets in Graphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-25211-2_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cornelsen, Sabine, Maximilian Pfister, Henry Förster, et al. "Drawing Shortest Paths in Geodetic Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-68766-3_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Foucaud, Florent, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, and S. Taruni. "Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity." In Algorithms and Discrete Applied Mathematics. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-52213-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Anand, Bijo S., Manoj Changat, and S. V. Ullas Chandran. "The Edge Geodetic Number of Product Graphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74180-2_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ekim, Tınaz, Aysel Erey, Pinar Heggernes, Pim van ’t Hof, and Daniel Meister. "Computing Minimum Geodetic Sets of Proper Interval Graphs." In LATIN 2012: Theoretical Informatics. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29344-3_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ullas Chandran, S. V., Mitre C. Dourado, and Maya G. S. Thankachy. "On the Geodetic and Hull Numbers of Shadow Graphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39219-2_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tuite, James, and Grahame Erskine. "New Bounds on k-Geodetic Digraphs and Mixed Graphs." In Trends in Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83823-2_124.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dourado, Mitre C., Lucia D. Penso, and Dieter Rautenbach. "Geodetic Convexity Parameters for Graphs with Few Short Induced Paths." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Geodetic graphs"

1

Liang, Hongda, Da Chen, Tao Chen, Li Liu, Jiong Zhang, and Laurent D. Cohen. "An adaptive geodesic voting method for curvilinear tree structure extraction." In Sixteenth International Conference on Graphics and Image Processing (ICGIP 2024), edited by Liang Xiao. SPIE, 2025. https://doi.org/10.1117/12.3057740.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Onur, Şeyma, and Gökşen Bacak Turan. "Geodetic Domination Integrity of Transformation Graphs." In 6th International Students Science Congress. Izmir International Guest Student Association, 2022. http://dx.doi.org/10.52460/issc.2022.030.

Full text
Abstract:
The concept of domination has a wide field of research in graph theory. The dominating set of a graph G is a subset S of vertices of G such that every vertex not in S is adjacent to at least one vertex in S [1]. The concept of domination has various types defined on vertices and edges. If each vertex in a dominating set S of the graph G is also a member of the geodetic set, then the set S is called a geodetic dominating set [2]. A communication network is a connection between centers and those centers that allow them to communicate with each other it consists of lines. These network centers ca
APA, Harvard, Vancouver, ISO, and other styles
3

Ponciano, Vitor, and Romulo Oliveira. "Convexidade em Grafo Linha de Bipartido." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6403.

Full text
Abstract:
For a nontrivial connected and simple graphs G= (V(G), E(G)), a set S E(G) is called edge geodetic set of G if every edge of G it’s in S or is contained in a geodesic joining some pair of edges in S. The edge geodetic number eds(G) of G is the minimum order of its edge geodetic sets. We prove that it is NP-complete to decide for a given bipartiti graphs G and a given integer k whether G has a edge geodetic set of cardinality at most k. A set M V(G) is called P3 set of G if all vertices of G have two neighbors in M. The P3 number of G is the minimum order of its P3 sets. We prove that it is NP-
APA, Harvard, Vancouver, ISO, and other styles
4

Mathew, Deepa, D. Antony Xavier, and Santiagu Theresal. "Geodetic propagation in graphs." In PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0016869.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

L. G., Bino Infanta, D. Antony Xavier, and Santiagu Theresal. "Strong (2,2) geodetic number of graphs." In PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0016819.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zaripova, F. Z., D. A. Petrova, A. G. Knyazev, and E. D. Kuznetsov. "Analysis of The Results of Geodetic Observations of Existing and Under Construction Facilities." In 52-st All-Russian with international participation student scientific conference "Physics of Space". Ural University Press, 2025. https://doi.org/10.15826/b978-5-7996-3986-0.52.

Full text
Abstract:
This paper analysis the results of geodetic observations of deformations of existing and underconstruction objects. The objects are considered in one region, with different types of foundation structures. The objects are located in the city of Yekaterinburg with pronounced climatic seasons, a significant temperature difference between winter and summer. An analysis of geodetic observations from June 2021 to March 2024 was carried out. When collecting spatial data, the conditions for the equality of shoulders for high-precision leveling were changed. Based on the observation data, graphs of the
APA, Harvard, Vancouver, ISO, and other styles
7

Vandaele, Robin, Yvan Saeys, and Tijl De Bie. "Graph Approximations to Geodesics on Metric Graphs." In 2020 25th International Conference on Pattern Recognition (ICPR). IEEE, 2021. http://dx.doi.org/10.1109/icpr48806.2021.9412448.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aziz, Haris, Serge Gaspers, and Kamran Najeebullah. "Weakening Covert Networks by Minimizing Inverse Geodesic Length." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/108.

Full text
Abstract:
We consider the problem of deleting nodes in a covert network to minimize its performance. The inverse geodesic length (IGL) is a well-known and widely used measure of network performance. It equals the sum of the inverse distances of all pairs of vertices. In the MinIGL problem the input is a graph $G$, a budget $k$, and a target IGL $T$, and the question is whether there exists a subset of vertices $X$ with $|X|=k$, such that the IGL of $G-X$ is at most $T$. In network analysis, the IGL is often used to evaluate how well heuristics perform in strengthening or weakening a network. In this pap
APA, Harvard, Vancouver, ISO, and other styles
9

Kulbiej, Eric. "Autonomous Vessels' Pathfinding Using Visibility Graph." In 2018 Baltic Geodetic Congress (BGC Geomatics). IEEE, 2018. http://dx.doi.org/10.1109/bgc-geomatics.2018.00026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Abila, R., and T. Binu Selin. "Nonsplit geodetic polynomial of a graph." In INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS, COMPUTING AND COMMUNICATION TECHNOLOGIES: (ICAMCCT 2021). AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0070850.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Geodetic graphs"

1

Ley, Matt, Tom Baldvins, David Jones, Hanna Pilkington, and Kelly Anderson. Vegetation classification and mapping: Gulf Islands National Seashore. National Park Service, 2023. http://dx.doi.org/10.36967/2299028.

Full text
Abstract:
The Gulf Islands National Seashore (GUIS) vegetation inventory project classified and mapped vegetation on park-owned lands within the administrative boundary and estimated thematic map accuracy quantitatively. The project began in June 2016. National Park Service (NPS) Vegetation Mapping Inventory Program provided technical guidance. The overall process included initial planning and scoping, imagery procurement, field data collection, data analysis, imagery interpretation/classification, accuracy assessment (AA), and report writing and database development. Initial planning and scoping meetin
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Geodetic graphs' for particular source types:
Journal articles Dissertations / Theses
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!

To the bibliography