Showing 1-25 of 3,625 resultsfor "Index Terms":Pair Of Vertices
"Index Terms":Pair Of Vertices
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
On the Adjacent Vertex Strong Distinguishing Total Chromatic Number of Some Graphs
2013 International Conference on Information Technology and Applications
Year: 2013 | Conference Paper |
Cited by: Papers (1)
The Minimum Path Cover (MinPC) problem on directed acyclic graphs (DAGs) is a classical problem in graph theory that provides a clear and simple mathematical formulation for several applications in computational biology. In this paper, we study the computational complexity of three constrained variants of MinPC motivated by the recent introduction of Next-Generation Sequencing technologies. The fi...Show More
Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum
Journal of Complex Networks
Cited by: Papers (3)
Getting a labelling of vertices close to the structure of the graph has been proved to be of interest in many applications, e.g. to follow signals indexed by the vertices of the network. This question can be related to a graph labelling problem known as the cyclic bandwidth sum problem (CBSP). It consists of finding a labelling of the vertices of an undirected and unweighted graph with distinct in...Show More
A Kind Of Conditional Vertex Connectivity Of Cayley Graphs Generated By Wheel Graphs
Let $G=(V(G), E(G))$ be a connected graph. A subset $T \subseteq V(G)$ is called an $R^{k}$-vertex-cut, if $G-T$ is disconnected and each vertex in $V(G)-T$ has at least $k$ neighbors in $G-T$. The cardinality of a minimum $R^{k}$-vertex-cut is the $R^{k}$-vertex-connectivity of $G$ and is denoted by $\kappa ^{k}(G)$. $R^{k}$-vertex-connectivity is a new measure to study the fault tolerance of net...Show More
Assortativity measures for weighted and directed networks
Journal of Complex Networks
Cited by: Papers (1)
Assortativity measures the tendency of a vertex in a network being connected by other vertexes with respect to some vertex-specific features. Classical assortativity coefficients are defined for unweighted and undirected networks with respect to vertex degree. We propose a class of assortativity coefficients that capture the assortative characteristics and structure of weighted and directed networ...Show More
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bisecto...Show More
Maximal Assortative Matching and Maximal Dissortative Matching for Complex Network Graphs
Matching of vertices in social networks and other complex networks needs to take into consideration the weight of the vertices (like degree) that are matched; arbitrary matching of the vertices with simply the objective of maximizing the number of vertices need not be of any practical benefit. Assortativity of the edges in a network is a measure of the similarity of the end vertices of the edges w...Show More
New mathematical model for finding minimum vertex cut set
2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI)
Year: 2012 | Conference Paper |
Cited by: Papers (5)
In this paper, we consider the vertex separator problem. Given an undirected graph G, the vertex separator problem consists in identifying a minimum number of vertex set whose removal disconnects G. We present a new mathematical model for solving this problem and also present computational results on graphs with various density.Show More
Aggregation Algorithms for Graph Coloring
2021 25th International Conference on Methods and Models in Automation and Robotics (MMAR)
Year: 2021 | Conference Paper |
Many practical applications in production systems can be formulated in terms of graph coloring, for example task scheduling or planning a robot moves. In the paper a class of heuristic algorithms for graph coloring is considered which use the technique of aggregation of vertices. It is shown that some well known constructive heuristics like GIS and RLF belong to the class of vertex aggregation alg...Show More
An efficient algorithm for the link allocation problem on ATM-based personal communication networks
The personal communication network (PCN) is an emerging wireless network that promises many new services for the telecommunication industry. The proliferation of demands for extending wireless services to integrated services which supports the transmission of data and multimedia information has resulted in the need for broadband wireless systems that are able to provide service capabilities simila...Show More
Biswapped networks of the form Bsw(G) have recently been proposed as interconnection networks to be implemented as optical transpose interconnection systems. We provide a systematic construction of κ+1 vertex-disjoint paths joining any two distinct vertices in Bsw(G), where κ≥1 is the connectivity of G. In doing so, we obtain an upper bound of max{2Δ(G)+5, Δκ(G)+Δ(G)+2} on the (κ+1)-diameter of Bs...Show More
A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident on a common vertex (angular resolution) or by the angles formed at edge crossings (crossing resolution). In this paper, we introduce the notion of ‘total resolution’, that is, the mini...Show More
Using Link Prediction to Estimate the Collaborative Influence of Researchers
Evelyn Perez-Cervantes;Jesús P. Mena-Chalco;Maria Cristina F. de Oliveira;Roberto M. Cesar
2013 IEEE 9th International Conference on e-Science
Year: 2013 | Conference Paper |
Cited by: Papers (9)
The influence of a particular individual in a scientific collaboration network could be measured in several ways. Estimating influence commonly requires calculating computationally costly global measures, which may be impractical on networks with hundreds of thousands of vertices. In this paper, we introduce new local measures to estimate the collaborative influence of individual researchers in a ...Show More
On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs
2016 IEEE First International Conference on Data Science in Cyberspace (DSC)
Year: 2016 | Conference Paper |
Analyzing chromatic number in coloring problem is a tough topic in graph analysis. We focus on the basic theory for a particular type of chromatic number. This will give us insights on the basic topological structure guiding lots of networks in the coming trend of big data era. An adjacent vertex-distinguishing total k-coloring is a proper total k-coloring of a graph G such that for any two adjace...Show More
Chromatic Partitioning of a Network and an Optimum Scheduling Problem
2023 Third International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT)
Year: 2023 | Conference Paper |
Cited by: Papers (3)
This article aims to study the chromatic polynomial of some families of graphs and to describe the properties of the chromatic polynomial of some graph operations. In addition, we will explore results related to a chromatic polynomial of the subgraph of path graph obtained after fusing two vertices that are at a finite distance. Also, we give an idea of optimum scheduling based on different color ...Show More
A total labeling $\phi: V(G)\cup E(G) \to \{1,2, {\dots }, k\}$ is called a vertex irregular total $k$ -labeling of a graph $G$ if different vertices in $G$ have different weights. The weight of a vertex is defined as the sum of the labels of its incident edges and the label of that vertex. The minimum $k$ for which the graph $G$ has a vertex irregular total $k$ -labeling is called the...Show More
Structural analysis of invertible graphs
2015 IEEE 9th International Conference on Intelligent Systems and Control (ISCO)
Year: 2015 | Conference Paper |
Reliability is an important issue in systems architecture. This paper focuses on a new class of invertible networks which are more reliable in the sense that if there is a failure in the physical components of the system then there always exists an alternate set of nodes to carry out the job in the complement. A graph G is said to be invertible if there exists an inverse vertex cover in G. The con...Show More
Expected Performance of Vertex Reconstruction in the ATLAS Experiment at the LHC
Eva Bouhova-Thacker;Vadim Kostyukhin;Thomas Koffas;Wolfgang Liebig;Maaike Limper;Giacinto Nicola Piacquadio;Kirill Prokofiev;Christian Weiser;Andreas Wildauer
In the harsh environment of the Large Hadron Collider at CERN (design luminosity of 1034 cm-2s-1) efficient reconstruction of vertices is crucial for many physics analyses. Described in this paper is the expected performance of the vertex reconstruction used in the ATLAS experiment. The algorithms for the reconstruction of primary and secondary vertices as well as for finding photon conversions an...Show More
In this paper, we have addressed the computation of an invariant of weakly triangulated graph. The invariant computed here are all possible maximal cliques of the specific graph class. The logic of computing all possible maximal cliques of weakly triangulated graph is based on one of its prime characterization, i.e., existence of more than one 2-pair in a weakly triangulated graph. For each graph ...Show More
On Path Cover Problems in Digraphs and Applications to Program Testing
In this paper various path cover problems, arising in program testing, are discussed. Dilworth's theorem for acyclic digraphs is generalized. Two methods for fmding a minimum set of paths (minimum path cover) that covers the vertices (or the edges) of a digraph are given. To model interactions among code segments, the notions of required pairs and required paths are introduced. It is shown that rm...Show More
A comparison of two fast algorithms for computing the distance between convex polyhedra
The problem of tracking the distance between two convex polyhedra is finding applications in many areas of robotics. The algorithm of Lin and Canny (1991) is a well-known fast solution to this problem, but by recasting the algorithms into configuration space, we show that a minor modification to the earlier algorithm of Gilbert, Johnson, and Keerthi (1988) also gives this algorithm the same expect...Show More
A λ-coloring of a graph G is an assignment of colors from the integer set {0,…,λ} to the vertices of the graph G such that vertices at distance of at most two get different colors and adjacent vertices get colors which are at least two apart. The problem of finding λ-colorings with optimal or near-optimal λ arises in the context of radio frequency assignment. We show that the problem of finding th...Show More
Motivated by results of Henry et al. (2011, PNAS, 108, 8605–8610), we propose a general scheme for evolving spatial networks to reduce their total edge lengths. We study the properties of the equilibria of two networks from this class, which interpolate between three well-studied objects: the Erdős-Rényi random graph, the random geometric graph and the minimum spanning tree. The first of our two e...Show More
We consider a model for complex networks that was introduced by Krioukov et al. (2010, Phys. Rev. E, 82, 036106), where the intrinsic hierarchies of a network are mapped into the hyperbolic plane. Krioukov et al. show that this model exhibits clustering and the distribution of its degrees has a power-law tail. We show that asymptotically this model locally behaves like the well-known Chung–Lu mode...Show More
Adjacent Vertex Reducible Total Coloring Algorithm for Several Joint Graphs
2023 IEEE 7th Information Technology and Mechatronics Engineering Conference (ITOEC)
Year: 2023 | Conference Paper |
For a simple graph G(V, E), if there exists a positive integer k (1 ≤ k ≤ |E| + |G|) and a mapping f: V(G) U E(G) → {1, 2, …, k} such that the color sets of adjacent vertices with the same degree are identical, then f represents the Adjacent Vertex Reducible Total Coloring(AVRTC) of the graph G. Building upon the existing research on reducible edge coloring and Adjacent Vertices Reducible Edge Lab...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.