Relevant bibliographies by topics / SD graph

Contents

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

Academic literature on the topic 'SD graph'

Author: Grafiati
Published: 3 June 2025
Last updated: 31 July 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 'SD graph.'

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 "SD graph"

1

Lourdusamy, A., S. Jenifer Wency, and F. Patrick. "On SD-Harmonious Labeling." Mapana - Journal of Sciences 17, no. 3 (2018): 1–15. http://dx.doi.org/10.12723/mjs.46.1.

Full text
Abstract:
A graph G is said to be SD-harmonious labeling if there exists an injection f: V(G) -> {0,1,2,...,q} such that the induced function f*: E(G) ->{0,2,...,2q-2} defined by f(uv)=S+D (mod 2q) is bijective, where S=f(u)+f(v) and D=|f(u)-f(v)|, for every edge uv in E(G). A graph which admits SD-harmonious labeling is called SD-harmonious graph. In this paper, we investigate SD-harmonious labeling of path related graphs, tree related graphs, star related graphs and disjoint union of graphs.
APA, Harvard, Vancouver, ISO, and other styles
2

A. Delman, S. Koilraj, and P. Lawrence Rozario Raj. "SD and k-SD Prime Cordial graphs." International Journal of Fuzzy Mathematical Archive 15, no. 02 (2018): 189–95. http://dx.doi.org/10.22457/ijfma.v15n2a9.

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

González Yero, Ismael. "The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families." Mathematics 8, no. 1 (2020): 125. http://dx.doi.org/10.3390/math8010125.

Full text
Abstract:
We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph. In concordance, we consider here connected graphs G whose vertex sets are represented as V ( G ) , and the following terminology. Two vertices u , v ∈ V ( G ) are strongly resolved by a vertex w ∈ V ( G ) , if there is a shortest w − v path containing u or a shortest w − u containing v. A set A of vertices of the graph G is said to be a strong metric generator for G if every two vertices of G are strongly resolve
APA, Harvard, Vancouver, ISO, and other styles
4

ANDRARI, FINATA RASTIC, MAIMUNAH MAIMUNAH, and NURMALA DEWI QADARSIH. "PENERAPAN ALGORITMA WELCH-POWELL PADA PENJADWALAN MATA PELAJARAN SD." E-Jurnal Matematika 12, no. 4 (2023): 268. http://dx.doi.org/10.24843/mtk.2023.v12.i04.p428.

Full text
Abstract:
In the context of scheduling class timetables and allocating teachers to specific subjects in schools, a common issue is the occurrence of schedule conflicts. These conflicts often result in situations where a teacher is assigned to teach the same subject at the same time in different classes, or where teachers are scheduled to teach different subjects simultaneously. The Welch Powell algorithm is a graph coloring method that can be applied to scheduling problems. The scheduling process begins by representing subjects and the teachers assigned to them as a graph. Each subject is represented as
APA, Harvard, Vancouver, ISO, and other styles
5

Imran, Muhammad, and Shehnaz Akhter. "Degree-based topological indices of double graphs and strong double graphs." Discrete Mathematics, Algorithms and Applications 09, no. 05 (2017): 1750066. http://dx.doi.org/10.1142/s1793830917500665.

Full text
Abstract:
The topological indices are useful tools to the theoretical chemists that are provided by the graph theory. They correlate certain physicochemical properties such as boiling point, strain energy, stability, etc. of chemical compounds. For a graph [Formula: see text], the double graph [Formula: see text] is a graph obtained by taking two copies of graph [Formula: see text] and joining each vertex in one copy with the neighbors of corresponding vertex in another copy and strong double graph SD[Formula: see text] of the graph [Formula: see text] is the graph obtained by taking two copies of the g
APA, Harvard, Vancouver, ISO, and other styles
6

FAVARON, O., R. KHOEILAR, and S. M. SHEIKHOLESLAMI. "TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS." Discrete Mathematics, Algorithms and Applications 05, no. 03 (2013): 1350009. http://dx.doi.org/10.1142/s1793830913500092.

Full text
Abstract:
A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set. The total outer-connected domination subdivision number sd γ toc (G) is the minimum number of edges that must be subdivided in order to increase the total outer-connected domination number. We prove the existence of sd γ toc (G) for every connected graph G of order at least 3 and give upper bounds on it in some classes of grap
APA, Harvard, Vancouver, ISO, and other styles
7

Hao, Jianlong, Zhibin Liu, Qiwei Sun, Chen Zhang, and Jie Wang. "A Static-Dynamic Hypergraph Neural Network Framework Based on Residual Learning for Stock Recommendation." Complexity 2024 (January 8, 2024): 1–12. http://dx.doi.org/10.1155/2024/5791802.

Full text
Abstract:
Stock ranking prediction is an effective method for achieving a high investment return and plays a crucial role in investment decisions. However, previous studies have overlooked the interconnections among stocks or have solely relied on predefined graphs for stock relationship information. The predefined graphs may not capture all possible relationships and may not be suitable for describing dynamic relationships. To address these issues, we propose a Static-Dynamic hypergraph neural network framework based on Residual Learning (SD-RL). Compared with traditional methods, SD-RL has the followi
APA, Harvard, Vancouver, ISO, and other styles
8

G. Navamani. "Optimizing Subdivisions on Fair Domination in Petersen Graph Structures." Advances in Nonlinear Variational Inequalities 28, no. 3s (2024): 20–29. https://doi.org/10.52783/anvi.v28.2845.

Full text
Abstract:
A fair dominating set (FDS) J is a dominating set of a graph H, such that all vertices in V \J are dominated by the same number of vertices of J. The fair domination number (FDN) is the minimum cardinality of a fair dominating set of H, denoted by γ_fd (H). The domination subdivision number (FDSN) 〖Sd〗_γ (H), represents the smallest number of edges in H that needs to be subdivided (with each edge being subdivided at most once) to increase the domination number of the graph. The fair domination subdivision number, 〖Sd〗_(γ_fd)^+ (H) (or 〖Sd〗_(γ_fd)^- (H)) is the minimum number of edge subdivisio
APA, Harvard, Vancouver, ISO, and other styles
9

Senchenko, Oleksii, and Mykola Prytula. "The presentation of deterministic and strongly deterministic graphs." Algebra and Discrete Mathematics 36, no. 2 (2023): 225–42. http://dx.doi.org/10.12958/adm2157.

Full text
Abstract:
The paper proposes a presentation of D-graphsand SD-graphs by a defining pair of words in the alphabet of their vertex labels. We present an algorithm that, given an arbitrary pair of sets, either constructs a D-graph for which this pair is the defining pair or informs that it is impossible to do so. We alsopresent an algorithm for constructing a canonical defining pair fora D-graph and find some numerical estimates of this pair.
APA, Harvard, Vancouver, ISO, and other styles
10

Kononov, Yu M., S. V. Sapunov, O. S. Senchenko, and V. V. Sliesariev. "Stochastic methods for modeling the topological operating environment of an autonomous mobile agent." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 38 (December 18, 2024): 79–95. https://doi.org/10.37069/1683-4720-2024-38-8.

Full text
Abstract:
Stochastic methods are used to model the topological operating environment of an autonomous mobile agent that performs goal-directed movement or navigation. For successful navigation, it is necessary to efficiently represent information about the environment, i.e. to create its map. The topological representation focuses on the structural characteristics of the environment and the connections between different areas of space. The model of this representation is a graph, where vertices represent important locations and edges represent possible paths between them. In this paper, the environment
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "SD graph"

1

Shah, Abhay. "Multiple surface segmentation using novel deep learning and graph based methods." Diss., University of Iowa, 2017. https://ir.uiowa.edu/etd/5630.

Full text
Abstract:
The task of automatically segmenting 3-D surfaces representing object boundaries is important in quantitative analysis of volumetric images, which plays a vital role in numerous biomedical applications. For the diagnosis and management of disease, segmentation of images of organs and tissues is a crucial step for the quantification of medical images. Segmentation finds the boundaries or, limited to the 3-D case, the surfaces, that separate regions, tissues or areas of an image, and it is essential that these boundaries approximate the true boundary, typically by human experts, as closely as po
APA, Harvard, Vancouver, ISO, and other styles
2

Antony, Bhavna Josephine. "A combined machine-learning and graph-based framework for the 3-D automated segmentation of retinal structures in SD-OCT images." Diss., University of Iowa, 2013. https://ir.uiowa.edu/etd/4944.

Full text
Abstract:
Spectral-domain optical coherence tomography (SD-OCT) is a non-invasive imaging modality that allows for the quantitative study of retinal structures. SD-OCT has begun to find widespread use in the diagnosis and management of various ocular diseases. While commercial scanners provide limited analysis of a small number of retinal layers, the automated segmentation of retinal layers and other structures within these volumetric images is quite a challenging problem, especially in the presence of disease-induced changes. The incorporation of a priori information, ranging from qualitative assessmen
APA, Harvard, Vancouver, ISO, and other styles
3

Miri, Mohammad Saleh. "A multimodal machine-learning graph-based approach for segmenting glaucomatous optic nerve head structures from SD-OCT volumes and fundus photographs." Diss., University of Iowa, 2016. https://ir.uiowa.edu/etd/5574.

Full text
Abstract:
Glaucoma is the second leading cause of blindness worldwide. The clinical standard for monitoring the functional deficits in the retina that are caused by glaucoma is the visual field test. In addition to monitoring the functional loss, evaluating the disease-related structural changes in the human retina also helps with diagnosis and management of this progressive disease. The characteristic changes of retinal structures such as the optic nerve head (ONH) are monitored utilizing imaging modalities such as color (stereo) fundus photography and, more recently, spectral-domain optical coherence
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "SD graph"

1

Prajapati, U. M., and A. V. Vantiya. "SD-Prime Cordial Labeling of Double k-Polygonal Snake Graph." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-6.

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

Zhang, Xianren, Jing Ma, Yushun Dong, Chen Chen, Min Gao, and Jundong Li. "SD-Attack: Targeted Spectral Attacks on Graphs." In Advances in Knowledge Discovery and Data Mining. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-2253-2_28.

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

Kljajic, Miroljub, Mirjana Kljajic Borštnar, Andrej Škraba, and Davorin Kofjac. "System Approach to MIS and DSS and its Modeling within SD." In Research Methodologies, Innovations and Philosophies in Software Systems Engineering and Information Systems. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0179-6.ch017.

Full text
Abstract:
In this chapter, the authors discuss system dynamics (SD) as a research methodology in Information Systems (IS). The goal is to demonstrate the usefulness of SD methodology in research and its implementation in IS and management Information Systems (MIS). The authors briefly discuss the fundamentals of SD methodology models and causal loop diagrams (CLD) as well as model validation. The usefulness of this transdisciplinary methodology has been demonstrated with the case of the quality of IS success and satisfaction. Some examples of modeling for public decision assessment of sustainable develo
APA, Harvard, Vancouver, ISO, and other styles
4

Kljajic, Miroljub, Mirjana Kljajic Borštnar, Andrej Škraba, and Davorin Kofjac. "System Approach to MIS and DSS and its Modeling within SD." In Regional Development. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0882-5.ch208.

Full text
Abstract:
In this chapter, the authors discuss system dynamics (SD) as a research methodology in Information Systems (IS). The goal is to demonstrate the usefulness of SD methodology in research and its implementation in IS and management Information Systems (MIS). The authors briefly discuss the fundamentals of SD methodology models and causal loop diagrams (CLD) as well as model validation. The usefulness of this transdisciplinary methodology has been demonstrated with the case of the quality of IS success and satisfaction. Some examples of modeling for public decision assessment of sustainable develo
APA, Harvard, Vancouver, ISO, and other styles
5

Atzmueller, Martin, Dennis Mollenhauer, and Andreas Schmidt. "Big Data Analytics Using Local Exceptionality Detection." In Advances in Business Information Systems and Analytics. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-5225-0293-7.ch007.

Full text
Abstract:
Large-scale data processing is one of the key challenges concerning many application domains, especially considering ubiquitous and big data. In these contexts, subgroup discovery provides both a flexible data analysis and knowledge discovery method. Subgroup discovery and pattern mining are important descriptive data mining tasks. They can be applied, for example, in order to obtain an overview on the relations in the data, for automatic hypotheses generation, and for a number of knowledge discovery applications. This chapter presents the novel SD-MapR algorithmic framework for large-scale lo
APA, Harvard, Vancouver, ISO, and other styles
6

Sun, Liu-Qing, Chao-Feng Zhu, and Jiang-Qin He. "Effect of Grape Seed Procyanidins Combined with Allicin on Lipid Levels in Hyperlipidemic Rats." In Studies in Health Technology and Informatics. IOS Press, 2023. http://dx.doi.org/10.3233/shti230833.

Full text
Abstract:
Objectives: To study the effects of grape seed proanthocyanidins (GSP) combined with allicin on serum lipids level and vascular damage in a rat model of hyperlipidemia. Materials and methods: SD rats(male, 170-220 gn= 40) were randomized into five groups (n = 8/group): modelhigh fat and cholesterol diet; controlnormal diet; model+low-dose (GSP+allicin )(GSP 45mg/kg, allicin 30mg/kg, orally); model+high-dose (GSP+allicin) (GSP180mg/kg, allicin 90mg/kg, orally) and positive control (model+simvastatin (4 mg/kg)). Normal control group was fed conventionally, and remaining four groups were fed high
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "SD graph"

1

Zhu, Julie Yixuan, Ruby Wang, Athena Liu, Charlie Xu, Pan Chan, and Skylar Zhang. "Semantic FaultAware (SFA): Proactive Fault Prediction Architecture in SD-WAN with Semantic Knowledge Graphs and Machine Learning." In GLOBECOM 2024 - 2024 IEEE Global Communications Conference. IEEE, 2024. https://doi.org/10.1109/globecom52923.2024.10901306.

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

Chen, Yuzhao, Yatao Bian, Xi Xiao, Yu Rong, Tingyang Xu, and Junzhou Huang. "On Self-Distilling Graph Neural Network." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/314.

Full text
Abstract:
Recently, the teacher-student knowledge distillation framework has demonstrated its potential in training Graph Neural Networks (GNNs). However, due to the difficulty of training over-parameterized GNN models, one may not easily obtain a satisfactory teacher model for distillation. Furthermore, the inefficient training process of teacher-student knowledge distillation also impedes its applications in GNN models. In this paper, we propose the first teacher-free knowledge distillation method for GNNs, termed GNN Self-Distillation (GNN-SD), that serves as a drop-in replacement of the standard tra
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, Shengyuan, Pei Lv, Yuzhen Zhang, et al. "Semi-Dynamic Hypergraph Neural Network for 3D Pose Estimation." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/109.

Full text
Abstract:
This paper proposes a novel Semi-Dynamic Hypergraph Neural Network (SD-HNN) to estimate 3D human pose from a single image. SD-HNN adopts hypergraph to represent the human body to effectively exploit the kinematic constrains among adjacent and non-adjacent joints. Specifically, a pose hypergraph in SD-HNN has two components. One is a static hypergraph constructed according to the conventional tree body structure. The other is the semi-dynamic hypergraph representing the dynamic kinematic constrains among different joints. These two hypergraphs are combined together to be trained in an end-to-en
APA, Harvard, Vancouver, ISO, and other styles
4

Smoroň, Jozef, Milica Schraggerová, Eva Rošková, and Nina Urukovičová. "VERIFICATION OF THE STABILITY OF THE TECHNOSTRESS QUESTIONNAIRE AND TECHNOSTRESS IN RELATION TO PERSONALITY FACETS." In PSYCHOLÓGIA PRÁCE A ORGANIZÁCIE 2023. Vydavateľstvo ŠafárikPress, Univerzita Pavla Jozefa Šafárika v Košiciach, 2023. http://dx.doi.org/10.33542/ppo-0265-7-09.

Full text
Abstract:
Aim: One of the negative aspects of using technology is technostress. As a relatively new phenomenon technostress brings new research challenges. The aim of our study was to examine how technostress and personality are interconnected. We chose less frequently used approach in personality research - the facets analysis. We also wanted to test the structure of technostress as construct, based on Ragu-Nathan, et al. (2008) approach that distinguishes 5 factors of technostress. Method: Research sample consisted of 257 participants, 143 women aged M = 39.25, SD = 12.18 and 114 men aged M = 34.64, S
APA, Harvard, Vancouver, ISO, and other styles
5

Hussain, Md Akter, Alauddin Bhuiyan, and Kotagiri Ramamohanarao. "Disc segmentation and BMO-MRW measurement from SD-OCT image using graph search and tracing of three bench mark reference layers of retina." In 2015 IEEE International Conference on Image Processing (ICIP). IEEE, 2015. http://dx.doi.org/10.1109/icip.2015.7351574.

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

Antony, Bhavna J., Michael D. Abràmoff, Milan Sonka, Young H. Kwon, and Mona K. Garvin. "Incorporation of texture-based features in optimal graph-theoretic approach with application to the 3D segmentation of intraretinal surfaces in SD-OCT volumes." In SPIE Medical Imaging, edited by David R. Haynor and Sébastien Ourselin. SPIE, 2012. http://dx.doi.org/10.1117/12.911491.

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

Antony, Bhavna J., Qi Song, Michael D. Abràmoff, Eliott Sohn, Xiaodong Wu, and Mona K. Garvin. "Incorporation of learned shape priors into a graph-theoretic approach with application to the 3D segmentation of intraretinal surfaces in SD-OCT volumes of mice." In SPIE Medical Imaging, edited by Robert C. Molthen and John B. Weaver. SPIE, 2014. http://dx.doi.org/10.1117/12.2043203.

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

Kasthuri, K., K. Karuppasamy, and K. Nagarajan. "SD-divisor labeling of path and cycle related graphs." In INTERNATIONAL CONFERENCE ON RECENT INNOVATIONS IN SCIENCE AND TECHNOLOGY (RIST 2021). AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0080291.

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

Reports on the topic "SD graph"

1

Or, Etti, David Galbraith, and Anne Fennell. Exploring mechanisms involved in grape bud dormancy: Large-scale analysis of expression reprogramming following controlled dormancy induction and dormancy release. United States Department of Agriculture, 2002. http://dx.doi.org/10.32747/2002.7587232.bard.

Full text
Abstract:
The timing of dormancy induction and release is very important to the economic production of table grape. Advances in manipulation of dormancy induction and dormancy release are dependent on the establishment of a comprehensive understanding of biological mechanisms involved in bud dormancy. To gain insight into these mechanisms we initiated the research that had two main objectives: A. Analyzing the expression profiles of large subsets of genes, following controlled dormancy induction and dormancy release, and assessing the role of known metabolic pathways, known regulatory genes and novel se
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'SD graph' for particular source types:
Journal articles
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